./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7e70badd Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dacce6-7352-4e57-b8e7-526316686769/bin/uautomizer-wIGwrQj20G/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dacce6-7352-4e57-b8e7-526316686769/bin/uautomizer-wIGwrQj20G/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dacce6-7352-4e57-b8e7-526316686769/bin/uautomizer-wIGwrQj20G/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dacce6-7352-4e57-b8e7-526316686769/bin/uautomizer-wIGwrQj20G/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dacce6-7352-4e57-b8e7-526316686769/bin/uautomizer-wIGwrQj20G/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dacce6-7352-4e57-b8e7-526316686769/bin/uautomizer-wIGwrQj20G --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 bd5e922bebe187c1230ec455171e0dbeb52eef7c95cec8ebc1ad02d91040db3c --- Real Ultimate output --- This is Ultimate 0.2.1-dev-7e70bad [2021-11-23 12:30:03,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 12:30:03,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 12:30:03,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 12:30:03,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 12:30:03,450 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 12:30:03,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 12:30:03,458 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 12:30:03,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 12:30:03,469 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 12:30:03,471 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 12:30:03,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 12:30:03,474 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 12:30:03,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 12:30:03,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 12:30:03,487 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 12:30:03,489 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 12:30:03,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 12:30:03,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 12:30:03,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 12:30:03,507 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 12:30:03,509 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 12:30:03,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 12:30:03,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 12:30:03,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 12:30:03,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 12:30:03,527 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 12:30:03,530 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 12:30:03,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 12:30:03,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 12:30:03,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 12:30:03,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 12:30:03,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 12:30:03,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 12:30:03,541 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 12:30:03,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 12:30:03,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 12:30:03,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 12:30:03,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 12:30:03,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 12:30:03,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 12:30:03,547 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dacce6-7352-4e57-b8e7-526316686769/bin/uautomizer-wIGwrQj20G/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-23 12:30:03,603 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 12:30:03,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 12:30:03,606 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 12:30:03,607 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 12:30:03,609 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 12:30:03,610 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 12:30:03,610 INFO L138 SettingsManager]: * Use SBE=true [2021-11-23 12:30:03,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 12:30:03,611 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 12:30:03,611 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 12:30:03,612 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 12:30:03,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 12:30:03,613 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 12:30:03,613 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 12:30:03,614 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 12:30:03,614 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 12:30:03,614 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 12:30:03,615 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-23 12:30:03,615 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 12:30:03,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 12:30:03,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 12:30:03,616 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 12:30:03,616 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 12:30:03,617 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-23 12:30:03,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 12:30:03,617 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-23 12:30:03,617 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-23 12:30:03,618 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 12:30:03,618 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 12:30:03,620 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dacce6-7352-4e57-b8e7-526316686769/bin/uautomizer-wIGwrQj20G/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dacce6-7352-4e57-b8e7-526316686769/bin/uautomizer-wIGwrQj20G 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 -> bd5e922bebe187c1230ec455171e0dbeb52eef7c95cec8ebc1ad02d91040db3c [2021-11-23 12:30:04,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 12:30:04,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 12:30:04,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 12:30:04,058 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 12:30:04,059 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 12:30:04,061 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dacce6-7352-4e57-b8e7-526316686769/bin/uautomizer-wIGwrQj20G/../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i [2021-11-23 12:30:04,156 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dacce6-7352-4e57-b8e7-526316686769/bin/uautomizer-wIGwrQj20G/data/9559ba81b/dcb3afafc3fd46819a3ba0bf63c0d8bd/FLAGc6446e80f [2021-11-23 12:30:05,405 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 12:30:05,406 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dacce6-7352-4e57-b8e7-526316686769/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i [2021-11-23 12:30:05,458 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dacce6-7352-4e57-b8e7-526316686769/bin/uautomizer-wIGwrQj20G/data/9559ba81b/dcb3afafc3fd46819a3ba0bf63c0d8bd/FLAGc6446e80f [2021-11-23 12:30:05,674 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dacce6-7352-4e57-b8e7-526316686769/bin/uautomizer-wIGwrQj20G/data/9559ba81b/dcb3afafc3fd46819a3ba0bf63c0d8bd [2021-11-23 12:30:05,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 12:30:05,679 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 12:30:05,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 12:30:05,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 12:30:05,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 12:30:05,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:30:05" (1/1) ... [2021-11-23 12:30:05,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c9656e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:05, skipping insertion in model container [2021-11-23 12:30:05,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:30:05" (1/1) ... [2021-11-23 12:30:05,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 12:30:05,855 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 12:30:06,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dacce6-7352-4e57-b8e7-526316686769/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4497,4510] [2021-11-23 12:30:06,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dacce6-7352-4e57-b8e7-526316686769/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4557,4570] [2021-11-23 12:30:07,697 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-23 12:30:07,699 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-23 12:30:07,703 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-23 12:30:07,705 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-23 12:30:07,708 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-23 12:30:07,732 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-23 12:30:07,735 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-23 12:30:07,742 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-23 12:30:07,744 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-23 12:30:08,227 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-23 12:30:08,229 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-23 12:30:08,231 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-23 12:30:08,232 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-23 12:30:08,234 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-23 12:30:08,235 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-23 12:30:08,236 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-23 12:30:08,237 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-23 12:30:08,238 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-23 12:30:08,239 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-23 12:30:08,454 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-23 12:30:08,686 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-23 12:30:08,687 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-23 12:30:08,761 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 12:30:08,818 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 12:30:08,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dacce6-7352-4e57-b8e7-526316686769/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4497,4510] [2021-11-23 12:30:08,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dacce6-7352-4e57-b8e7-526316686769/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4557,4570] [2021-11-23 12:30:08,881 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-23 12:30:08,891 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-23 12:30:08,895 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-23 12:30:08,903 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-23 12:30:08,905 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-23 12:30:08,912 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-23 12:30:08,922 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-23 12:30:08,923 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-23 12:30:08,925 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-23 12:30:08,994 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-23 12:30:08,995 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-23 12:30:08,996 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-23 12:30:08,997 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-23 12:30:08,998 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-23 12:30:08,998 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-23 12:30:08,999 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-23 12:30:09,000 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-23 12:30:09,000 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-23 12:30:09,001 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-23 12:30:09,088 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-23 12:30:09,147 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-23 12:30:09,148 WARN L1533 CHandler]: Possible shadowing of function index [2021-11-23 12:30:09,183 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 12:30:09,484 INFO L208 MainTranslator]: Completed translation [2021-11-23 12:30:09,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:09 WrapperNode [2021-11-23 12:30:09,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 12:30:09,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 12:30:09,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 12:30:09,487 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 12:30:09,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:09" (1/1) ... [2021-11-23 12:30:09,698 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:09" (1/1) ... [2021-11-23 12:30:09,876 INFO L137 Inliner]: procedures = 690, calls = 2615, calls flagged for inlining = 946, calls inlined = 19, statements flattened = 935 [2021-11-23 12:30:09,877 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 12:30:09,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 12:30:09,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 12:30:09,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 12:30:09,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:09" (1/1) ... [2021-11-23 12:30:09,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:09" (1/1) ... [2021-11-23 12:30:09,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:09" (1/1) ... [2021-11-23 12:30:09,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:09" (1/1) ... [2021-11-23 12:30:09,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:09" (1/1) ... [2021-11-23 12:30:09,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:09" (1/1) ... [2021-11-23 12:30:09,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:09" (1/1) ... [2021-11-23 12:30:09,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 12:30:10,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 12:30:10,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 12:30:10,011 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 12:30:10,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:09" (1/1) ... [2021-11-23 12:30:10,022 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 12:30:10,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dacce6-7352-4e57-b8e7-526316686769/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 12:30:10,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dacce6-7352-4e57-b8e7-526316686769/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 12:30:10,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dacce6-7352-4e57-b8e7-526316686769/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 12:30:10,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 12:30:10,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-23 12:30:10,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-23 12:30:10,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 12:30:10,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-23 12:30:10,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 12:30:10,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 12:30:10,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-23 12:30:10,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-23 12:30:10,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-23 12:30:10,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-23 12:30:10,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 12:30:10,526 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 12:30:10,543 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 12:30:12,529 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 12:30:12,538 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 12:30:12,538 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-23 12:30:12,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:30:12 BoogieIcfgContainer [2021-11-23 12:30:12,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 12:30:12,543 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 12:30:12,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 12:30:12,547 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 12:30:12,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:30:05" (1/3) ... [2021-11-23 12:30:12,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291c3fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:30:12, skipping insertion in model container [2021-11-23 12:30:12,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:30:09" (2/3) ... [2021-11-23 12:30:12,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291c3fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:30:12, skipping insertion in model container [2021-11-23 12:30:12,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:30:12" (3/3) ... [2021-11-23 12:30:12,551 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_array_harness.i [2021-11-23 12:30:12,558 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 12:30:12,558 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2021-11-23 12:30:12,621 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 12:30:12,630 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 12:30:12,630 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-11-23 12:30:12,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 78 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:12,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-23 12:30:12,666 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:12,666 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:30:12,667 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:12,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:12,674 INFO L85 PathProgramCache]: Analyzing trace with hash 810375617, now seen corresponding path program 1 times [2021-11-23 12:30:12,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:12,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979265306] [2021-11-23 12:30:12,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:12,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:13,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:13,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:13,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979265306] [2021-11-23 12:30:13,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979265306] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:13,434 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:13,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 12:30:13,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444396345] [2021-11-23 12:30:13,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:13,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-23 12:30:13,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:13,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-23 12:30:13,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-23 12:30:13,483 INFO L87 Difference]: Start difference. First operand has 79 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 78 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:13,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:13,513 INFO L93 Difference]: Finished difference Result 155 states and 206 transitions. [2021-11-23 12:30:13,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-23 12:30:13,516 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-11-23 12:30:13,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:13,529 INFO L225 Difference]: With dead ends: 155 [2021-11-23 12:30:13,529 INFO L226 Difference]: Without dead ends: 72 [2021-11-23 12:30:13,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-23 12:30:13,547 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:13,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 12:30:13,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-11-23 12:30:13,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-11-23 12:30:13,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.323076923076923) internal successors, (86), 71 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:13,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2021-11-23 12:30:13,610 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 14 [2021-11-23 12:30:13,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:13,612 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2021-11-23 12:30:13,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:13,617 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2021-11-23 12:30:13,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-23 12:30:13,618 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:13,619 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:30:13,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 12:30:13,621 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:13,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:13,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1068541055, now seen corresponding path program 1 times [2021-11-23 12:30:13,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:13,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278906351] [2021-11-23 12:30:13,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:13,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:13,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:13,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:13,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278906351] [2021-11-23 12:30:13,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278906351] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:13,884 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:13,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 12:30:13,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199742665] [2021-11-23 12:30:13,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:13,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 12:30:13,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:13,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 12:30:13,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 12:30:13,888 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:13,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:13,952 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2021-11-23 12:30:13,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 12:30:13,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-11-23 12:30:13,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:13,955 INFO L225 Difference]: With dead ends: 122 [2021-11-23 12:30:13,955 INFO L226 Difference]: Without dead ends: 72 [2021-11-23 12:30:13,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 12:30:13,957 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 61 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:13,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 178 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 12:30:13,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-11-23 12:30:13,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-11-23 12:30:13,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 71 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2021-11-23 12:30:13,968 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 14 [2021-11-23 12:30:13,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:13,969 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2021-11-23 12:30:13,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:13,969 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2021-11-23 12:30:13,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-23 12:30:13,970 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:13,970 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] [2021-11-23 12:30:13,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 12:30:13,971 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:13,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:13,972 INFO L85 PathProgramCache]: Analyzing trace with hash -715146382, now seen corresponding path program 1 times [2021-11-23 12:30:13,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:13,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056030951] [2021-11-23 12:30:13,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:13,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:14,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:14,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:14,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056030951] [2021-11-23 12:30:14,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056030951] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:14,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:14,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 12:30:14,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109948822] [2021-11-23 12:30:14,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:14,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 12:30:14,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:14,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 12:30:14,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 12:30:14,194 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:14,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:14,282 INFO L93 Difference]: Finished difference Result 175 states and 216 transitions. [2021-11-23 12:30:14,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 12:30:14,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-11-23 12:30:14,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:14,285 INFO L225 Difference]: With dead ends: 175 [2021-11-23 12:30:14,285 INFO L226 Difference]: Without dead ends: 116 [2021-11-23 12:30:14,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 12:30:14,287 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 70 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:14,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 278 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 12:30:14,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-23 12:30:14,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 76. [2021-11-23 12:30:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.289855072463768) internal successors, (89), 75 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-23 12:30:14,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2021-11-23 12:30:14,299 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 20 [2021-11-23 12:30:14,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:14,300 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2021-11-23 12:30:14,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:14,300 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2021-11-23 12:30:14,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-23 12:30:14,301 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:14,301 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] [2021-11-23 12:30:14,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 12:30:14,302 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:14,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:14,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1524493008, now seen corresponding path program 1 times [2021-11-23 12:30:14,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:14,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220160594] [2021-11-23 12:30:14,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:14,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:14,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:14,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220160594] [2021-11-23 12:30:14,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220160594] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:14,535 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:14,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 12:30:14,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045643826] [2021-11-23 12:30:14,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:14,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 12:30:14,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:14,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 12:30:14,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 12:30:14,538 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:14,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:14,629 INFO L93 Difference]: Finished difference Result 149 states and 176 transitions. [2021-11-23 12:30:14,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 12:30:14,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-11-23 12:30:14,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:14,631 INFO L225 Difference]: With dead ends: 149 [2021-11-23 12:30:14,631 INFO L226 Difference]: Without dead ends: 96 [2021-11-23 12:30:14,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 12:30:14,633 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 49 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:14,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 224 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 12:30:14,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-11-23 12:30:14,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 80. [2021-11-23 12:30:14,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 73 states have (on average 1.273972602739726) internal successors, (93), 79 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:14,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2021-11-23 12:30:14,643 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 20 [2021-11-23 12:30:14,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:14,643 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2021-11-23 12:30:14,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:14,644 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2021-11-23 12:30:14,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-23 12:30:14,645 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:14,645 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] [2021-11-23 12:30:14,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 12:30:14,645 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:14,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:14,646 INFO L85 PathProgramCache]: Analyzing trace with hash -322119372, now seen corresponding path program 1 times [2021-11-23 12:30:14,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:14,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287104016] [2021-11-23 12:30:14,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:14,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:14,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:14,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287104016] [2021-11-23 12:30:14,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287104016] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:14,963 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:14,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 12:30:14,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324691686] [2021-11-23 12:30:14,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:14,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 12:30:14,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:14,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 12:30:14,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 12:30:14,966 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:15,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:15,202 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2021-11-23 12:30:15,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 12:30:15,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-11-23 12:30:15,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:15,205 INFO L225 Difference]: With dead ends: 141 [2021-11-23 12:30:15,205 INFO L226 Difference]: Without dead ends: 137 [2021-11-23 12:30:15,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-23 12:30:15,207 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 105 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:15,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 410 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 12:30:15,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-11-23 12:30:15,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 88. [2021-11-23 12:30:15,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 87 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:15,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2021-11-23 12:30:15,218 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 20 [2021-11-23 12:30:15,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:15,219 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2021-11-23 12:30:15,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:15,219 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2021-11-23 12:30:15,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-23 12:30:15,220 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:15,220 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] [2021-11-23 12:30:15,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-23 12:30:15,221 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:15,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:15,222 INFO L85 PathProgramCache]: Analyzing trace with hash -2144800216, now seen corresponding path program 1 times [2021-11-23 12:30:15,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:15,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457839019] [2021-11-23 12:30:15,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:15,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:16,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:16,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:16,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457839019] [2021-11-23 12:30:16,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457839019] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:16,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:16,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 12:30:16,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159171101] [2021-11-23 12:30:16,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:16,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 12:30:16,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:16,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 12:30:16,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-23 12:30:16,132 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:16,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:16,553 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2021-11-23 12:30:16,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 12:30:16,554 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-11-23 12:30:16,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:16,555 INFO L225 Difference]: With dead ends: 155 [2021-11-23 12:30:16,555 INFO L226 Difference]: Without dead ends: 95 [2021-11-23 12:30:16,556 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-11-23 12:30:16,557 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 159 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:16,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 334 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 12:30:16,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-11-23 12:30:16,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2021-11-23 12:30:16,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 89 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:16,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2021-11-23 12:30:16,569 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 24 [2021-11-23 12:30:16,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:16,570 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2021-11-23 12:30:16,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:16,571 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2021-11-23 12:30:16,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-23 12:30:16,572 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:16,573 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] [2021-11-23 12:30:16,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-23 12:30:16,573 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:16,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:16,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1464741846, now seen corresponding path program 1 times [2021-11-23 12:30:16,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:16,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636373815] [2021-11-23 12:30:16,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:16,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:16,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:16,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:16,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636373815] [2021-11-23 12:30:16,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636373815] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:16,914 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:16,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 12:30:16,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759006378] [2021-11-23 12:30:16,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:16,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 12:30:16,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:16,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 12:30:16,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-23 12:30:16,917 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:17,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:17,166 INFO L93 Difference]: Finished difference Result 209 states and 234 transitions. [2021-11-23 12:30:17,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 12:30:17,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-11-23 12:30:17,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:17,169 INFO L225 Difference]: With dead ends: 209 [2021-11-23 12:30:17,169 INFO L226 Difference]: Without dead ends: 145 [2021-11-23 12:30:17,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-23 12:30:17,170 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 115 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:17,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 280 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 12:30:17,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-11-23 12:30:17,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2021-11-23 12:30:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 95 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:17,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2021-11-23 12:30:17,196 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 24 [2021-11-23 12:30:17,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:17,197 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2021-11-23 12:30:17,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:17,197 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2021-11-23 12:30:17,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-23 12:30:17,198 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:17,199 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:30:17,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-23 12:30:17,202 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:17,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:17,203 INFO L85 PathProgramCache]: Analyzing trace with hash -711790034, now seen corresponding path program 1 times [2021-11-23 12:30:17,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:17,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801717436] [2021-11-23 12:30:17,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:17,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:17,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:17,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:17,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801717436] [2021-11-23 12:30:17,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801717436] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:17,603 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:17,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-23 12:30:17,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954828834] [2021-11-23 12:30:17,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:17,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 12:30:17,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:17,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 12:30:17,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-23 12:30:17,605 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:18,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:18,197 INFO L93 Difference]: Finished difference Result 301 states and 349 transitions. [2021-11-23 12:30:18,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-23 12:30:18,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-11-23 12:30:18,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:18,199 INFO L225 Difference]: With dead ends: 301 [2021-11-23 12:30:18,200 INFO L226 Difference]: Without dead ends: 225 [2021-11-23 12:30:18,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-11-23 12:30:18,201 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 291 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:18,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 666 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 12:30:18,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-11-23 12:30:18,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 101. [2021-11-23 12:30:18,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 100 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:18,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2021-11-23 12:30:18,211 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 24 [2021-11-23 12:30:18,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:18,212 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2021-11-23 12:30:18,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:18,212 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2021-11-23 12:30:18,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-23 12:30:18,213 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:18,214 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:30:18,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-23 12:30:18,214 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:18,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:18,215 INFO L85 PathProgramCache]: Analyzing trace with hash -453624596, now seen corresponding path program 1 times [2021-11-23 12:30:18,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:18,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080750623] [2021-11-23 12:30:18,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:18,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:18,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:18,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:18,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080750623] [2021-11-23 12:30:18,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080750623] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:18,860 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:18,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-23 12:30:18,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826008421] [2021-11-23 12:30:18,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:18,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 12:30:18,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:18,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 12:30:18,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-23 12:30:18,862 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:19,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:19,402 INFO L93 Difference]: Finished difference Result 191 states and 215 transitions. [2021-11-23 12:30:19,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 12:30:19,403 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-11-23 12:30:19,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:19,405 INFO L225 Difference]: With dead ends: 191 [2021-11-23 12:30:19,405 INFO L226 Difference]: Without dead ends: 117 [2021-11-23 12:30:19,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-11-23 12:30:19,406 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 238 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:19,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 344 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 12:30:19,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-23 12:30:19,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2021-11-23 12:30:19,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 92 states have (on average 1.2173913043478262) internal successors, (112), 98 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:19,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2021-11-23 12:30:19,421 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 24 [2021-11-23 12:30:19,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:19,422 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2021-11-23 12:30:19,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:19,422 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2021-11-23 12:30:19,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-23 12:30:19,428 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:19,428 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] [2021-11-23 12:30:19,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-23 12:30:19,429 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:19,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:19,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1994829360, now seen corresponding path program 1 times [2021-11-23 12:30:19,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:19,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212527349] [2021-11-23 12:30:19,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:19,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:19,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:19,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:19,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212527349] [2021-11-23 12:30:19,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212527349] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:19,903 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:19,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-23 12:30:19,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749503591] [2021-11-23 12:30:19,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:19,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 12:30:19,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:19,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 12:30:19,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-23 12:30:19,905 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:20,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:20,274 INFO L93 Difference]: Finished difference Result 187 states and 210 transitions. [2021-11-23 12:30:20,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 12:30:20,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-11-23 12:30:20,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:20,276 INFO L225 Difference]: With dead ends: 187 [2021-11-23 12:30:20,276 INFO L226 Difference]: Without dead ends: 117 [2021-11-23 12:30:20,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-23 12:30:20,278 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 64 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:20,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 354 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 12:30:20,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-23 12:30:20,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2021-11-23 12:30:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 92 states have (on average 1.2065217391304348) internal successors, (111), 98 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2021-11-23 12:30:20,288 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 24 [2021-11-23 12:30:20,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:20,289 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2021-11-23 12:30:20,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:20,289 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2021-11-23 12:30:20,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-23 12:30:20,298 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:20,299 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] [2021-11-23 12:30:20,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-23 12:30:20,299 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:20,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:20,300 INFO L85 PathProgramCache]: Analyzing trace with hash -2041972498, now seen corresponding path program 1 times [2021-11-23 12:30:20,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:20,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652771508] [2021-11-23 12:30:20,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:20,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:20,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:20,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:20,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652771508] [2021-11-23 12:30:20,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652771508] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:20,576 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:20,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-23 12:30:20,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292126960] [2021-11-23 12:30:20,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:20,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 12:30:20,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:20,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 12:30:20,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-23 12:30:20,578 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:20,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:20,940 INFO L93 Difference]: Finished difference Result 238 states and 264 transitions. [2021-11-23 12:30:20,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 12:30:20,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-11-23 12:30:20,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:20,943 INFO L225 Difference]: With dead ends: 238 [2021-11-23 12:30:20,943 INFO L226 Difference]: Without dead ends: 166 [2021-11-23 12:30:20,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-23 12:30:20,971 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 234 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:20,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 363 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 12:30:20,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-11-23 12:30:20,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 94. [2021-11-23 12:30:20,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 87 states have (on average 1.1839080459770115) internal successors, (103), 93 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:20,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2021-11-23 12:30:20,988 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 24 [2021-11-23 12:30:20,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:20,989 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2021-11-23 12:30:20,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:20,989 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2021-11-23 12:30:20,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-23 12:30:20,993 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:20,993 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] [2021-11-23 12:30:20,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-23 12:30:20,994 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:20,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:20,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1548380899, now seen corresponding path program 1 times [2021-11-23 12:30:20,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:20,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836525889] [2021-11-23 12:30:20,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:20,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:21,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:21,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:21,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836525889] [2021-11-23 12:30:21,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836525889] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:21,282 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:21,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 12:30:21,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773089208] [2021-11-23 12:30:21,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:21,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 12:30:21,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:21,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 12:30:21,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-23 12:30:21,287 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:21,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:21,666 INFO L93 Difference]: Finished difference Result 167 states and 182 transitions. [2021-11-23 12:30:21,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-23 12:30:21,667 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-11-23 12:30:21,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:21,669 INFO L225 Difference]: With dead ends: 167 [2021-11-23 12:30:21,669 INFO L226 Difference]: Without dead ends: 163 [2021-11-23 12:30:21,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-11-23 12:30:21,670 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 116 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:21,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 568 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 12:30:21,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-11-23 12:30:21,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 98. [2021-11-23 12:30:21,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 91 states have (on average 1.1758241758241759) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2021-11-23 12:30:21,679 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 26 [2021-11-23 12:30:21,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:21,679 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2021-11-23 12:30:21,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:21,680 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2021-11-23 12:30:21,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-23 12:30:21,688 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:21,689 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] [2021-11-23 12:30:21,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-23 12:30:21,689 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:21,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:21,690 INFO L85 PathProgramCache]: Analyzing trace with hash 739034273, now seen corresponding path program 1 times [2021-11-23 12:30:21,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:21,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040373727] [2021-11-23 12:30:21,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:21,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:22,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:22,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:22,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040373727] [2021-11-23 12:30:22,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040373727] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:22,251 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:22,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-23 12:30:22,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19158582] [2021-11-23 12:30:22,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:22,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-23 12:30:22,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:22,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-23 12:30:22,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2021-11-23 12:30:22,253 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:23,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:23,511 INFO L93 Difference]: Finished difference Result 182 states and 198 transitions. [2021-11-23 12:30:23,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-23 12:30:23,512 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-11-23 12:30:23,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:23,514 INFO L225 Difference]: With dead ends: 182 [2021-11-23 12:30:23,514 INFO L226 Difference]: Without dead ends: 180 [2021-11-23 12:30:23,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=389, Invalid=1503, Unknown=0, NotChecked=0, Total=1892 [2021-11-23 12:30:23,516 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 364 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:23,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [364 Valid, 764 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-23 12:30:23,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-11-23 12:30:23,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 106. [2021-11-23 12:30:23,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 99 states have (on average 1.1717171717171717) internal successors, (116), 105 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:23,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2021-11-23 12:30:23,531 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 26 [2021-11-23 12:30:23,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:23,532 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2021-11-23 12:30:23,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:23,532 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2021-11-23 12:30:23,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-23 12:30:23,533 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:23,533 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] [2021-11-23 12:30:23,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-23 12:30:23,534 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:23,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:23,535 INFO L85 PathProgramCache]: Analyzing trace with hash -949909469, now seen corresponding path program 1 times [2021-11-23 12:30:23,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:23,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531459957] [2021-11-23 12:30:23,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:23,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:23,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:23,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:23,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531459957] [2021-11-23 12:30:23,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531459957] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:23,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:23,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 12:30:23,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485191219] [2021-11-23 12:30:23,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:23,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 12:30:23,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:23,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 12:30:23,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 12:30:23,828 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:24,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:24,127 INFO L93 Difference]: Finished difference Result 238 states and 260 transitions. [2021-11-23 12:30:24,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 12:30:24,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-11-23 12:30:24,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:24,130 INFO L225 Difference]: With dead ends: 238 [2021-11-23 12:30:24,130 INFO L226 Difference]: Without dead ends: 172 [2021-11-23 12:30:24,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-23 12:30:24,132 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 230 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:24,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 281 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 12:30:24,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-11-23 12:30:24,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 98. [2021-11-23 12:30:24,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:24,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2021-11-23 12:30:24,142 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 26 [2021-11-23 12:30:24,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:24,143 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2021-11-23 12:30:24,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:24,143 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2021-11-23 12:30:24,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-23 12:30:24,145 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:24,145 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] [2021-11-23 12:30:24,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-23 12:30:24,145 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:24,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:24,146 INFO L85 PathProgramCache]: Analyzing trace with hash -365390039, now seen corresponding path program 1 times [2021-11-23 12:30:24,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:24,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775412457] [2021-11-23 12:30:24,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:24,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:24,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:24,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:24,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775412457] [2021-11-23 12:30:24,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775412457] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:24,342 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:24,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 12:30:24,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769894412] [2021-11-23 12:30:24,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:24,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 12:30:24,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:24,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 12:30:24,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 12:30:24,344 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:24,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:24,396 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2021-11-23 12:30:24,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 12:30:24,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2021-11-23 12:30:24,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:24,401 INFO L225 Difference]: With dead ends: 128 [2021-11-23 12:30:24,401 INFO L226 Difference]: Without dead ends: 98 [2021-11-23 12:30:24,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 12:30:24,405 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 93 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:24,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 111 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 12:30:24,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-11-23 12:30:24,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-11-23 12:30:24,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 92 states have (on average 1.1521739130434783) internal successors, (106), 97 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2021-11-23 12:30:24,415 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 26 [2021-11-23 12:30:24,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:24,415 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2021-11-23 12:30:24,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:24,416 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2021-11-23 12:30:24,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 12:30:24,417 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:24,417 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:30:24,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-23 12:30:24,418 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:24,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:24,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1400671456, now seen corresponding path program 1 times [2021-11-23 12:30:24,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:24,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450886887] [2021-11-23 12:30:24,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:24,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:25,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:25,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:25,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450886887] [2021-11-23 12:30:25,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450886887] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:25,049 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:25,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-23 12:30:25,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527233036] [2021-11-23 12:30:25,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:25,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 12:30:25,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:25,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 12:30:25,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-23 12:30:25,051 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:25,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:25,533 INFO L93 Difference]: Finished difference Result 162 states and 175 transitions. [2021-11-23 12:30:25,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 12:30:25,534 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-11-23 12:30:25,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:25,535 INFO L225 Difference]: With dead ends: 162 [2021-11-23 12:30:25,535 INFO L226 Difference]: Without dead ends: 160 [2021-11-23 12:30:25,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-11-23 12:30:25,537 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 426 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:25,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [426 Valid, 380 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 12:30:25,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-11-23 12:30:25,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 137. [2021-11-23 12:30:25,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 131 states have (on average 1.1603053435114503) internal successors, (152), 136 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:25,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 152 transitions. [2021-11-23 12:30:25,549 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 152 transitions. Word has length 34 [2021-11-23 12:30:25,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:25,549 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 152 transitions. [2021-11-23 12:30:25,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:25,550 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 152 transitions. [2021-11-23 12:30:25,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 12:30:25,550 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:25,551 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:30:25,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-23 12:30:25,551 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:25,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:25,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1720376510, now seen corresponding path program 1 times [2021-11-23 12:30:25,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:25,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19907155] [2021-11-23 12:30:25,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:25,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:26,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:26,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:26,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19907155] [2021-11-23 12:30:26,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19907155] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:26,162 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:26,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-23 12:30:26,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001839465] [2021-11-23 12:30:26,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:26,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 12:30:26,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:26,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 12:30:26,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-23 12:30:26,164 INFO L87 Difference]: Start difference. First operand 137 states and 152 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:26,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:26,758 INFO L93 Difference]: Finished difference Result 160 states and 173 transitions. [2021-11-23 12:30:26,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 12:30:26,759 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-23 12:30:26,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:26,760 INFO L225 Difference]: With dead ends: 160 [2021-11-23 12:30:26,760 INFO L226 Difference]: Without dead ends: 158 [2021-11-23 12:30:26,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2021-11-23 12:30:26,762 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 438 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:26,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [438 Valid, 370 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-23 12:30:26,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-11-23 12:30:26,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 139. [2021-11-23 12:30:26,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 133 states have (on average 1.1578947368421053) internal successors, (154), 138 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-23 12:30:26,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2021-11-23 12:30:26,775 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 36 [2021-11-23 12:30:26,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:26,776 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2021-11-23 12:30:26,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:26,776 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2021-11-23 12:30:26,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 12:30:26,777 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:26,777 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:30:26,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-23 12:30:26,779 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:26,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:26,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1549467370, now seen corresponding path program 1 times [2021-11-23 12:30:26,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:26,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993992250] [2021-11-23 12:30:26,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:26,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:27,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:27,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:27,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993992250] [2021-11-23 12:30:27,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993992250] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:27,070 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:27,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-23 12:30:27,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310149172] [2021-11-23 12:30:27,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:27,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 12:30:27,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:27,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 12:30:27,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-23 12:30:27,075 INFO L87 Difference]: Start difference. First operand 139 states and 154 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:27,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:27,421 INFO L93 Difference]: Finished difference Result 271 states and 296 transitions. [2021-11-23 12:30:27,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 12:30:27,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-23 12:30:27,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:27,424 INFO L225 Difference]: With dead ends: 271 [2021-11-23 12:30:27,424 INFO L226 Difference]: Without dead ends: 230 [2021-11-23 12:30:27,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2021-11-23 12:30:27,425 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 173 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:27,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 249 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 12:30:27,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-11-23 12:30:27,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 145. [2021-11-23 12:30:27,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 139 states have (on average 1.1654676258992807) internal successors, (162), 144 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-23 12:30:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 162 transitions. [2021-11-23 12:30:27,438 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 162 transitions. Word has length 36 [2021-11-23 12:30:27,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:27,439 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 162 transitions. [2021-11-23 12:30:27,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:27,439 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 162 transitions. [2021-11-23 12:30:27,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 12:30:27,440 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:27,441 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:30:27,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-23 12:30:27,441 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:27,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:27,442 INFO L85 PathProgramCache]: Analyzing trace with hash -869409000, now seen corresponding path program 1 times [2021-11-23 12:30:27,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:27,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012314019] [2021-11-23 12:30:27,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:27,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:27,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:27,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:27,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012314019] [2021-11-23 12:30:27,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012314019] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:27,849 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:27,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-23 12:30:27,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163064272] [2021-11-23 12:30:27,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:27,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-23 12:30:27,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:27,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-23 12:30:27,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-23 12:30:27,852 INFO L87 Difference]: Start difference. First operand 145 states and 162 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:28,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:28,306 INFO L93 Difference]: Finished difference Result 204 states and 220 transitions. [2021-11-23 12:30:28,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 12:30:28,307 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-23 12:30:28,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:28,310 INFO L225 Difference]: With dead ends: 204 [2021-11-23 12:30:28,310 INFO L226 Difference]: Without dead ends: 163 [2021-11-23 12:30:28,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-11-23 12:30:28,311 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 231 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:28,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 450 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 12:30:28,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-11-23 12:30:28,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 142. [2021-11-23 12:30:28,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 136 states have (on average 1.1544117647058822) internal successors, (157), 141 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:28,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 157 transitions. [2021-11-23 12:30:28,325 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 157 transitions. Word has length 36 [2021-11-23 12:30:28,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:28,326 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 157 transitions. [2021-11-23 12:30:28,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:28,326 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2021-11-23 12:30:28,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 12:30:28,327 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:28,327 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:30:28,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-23 12:30:28,328 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:28,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:28,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1291301932, now seen corresponding path program 1 times [2021-11-23 12:30:28,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:28,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495874658] [2021-11-23 12:30:28,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:28,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:28,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:28,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:28,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495874658] [2021-11-23 12:30:28,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495874658] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:28,584 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:28,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 12:30:28,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036972176] [2021-11-23 12:30:28,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:28,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 12:30:28,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:28,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 12:30:28,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-23 12:30:28,587 INFO L87 Difference]: Start difference. First operand 142 states and 157 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:28,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:28,800 INFO L93 Difference]: Finished difference Result 274 states and 297 transitions. [2021-11-23 12:30:28,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 12:30:28,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-23 12:30:28,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:28,803 INFO L225 Difference]: With dead ends: 274 [2021-11-23 12:30:28,803 INFO L226 Difference]: Without dead ends: 211 [2021-11-23 12:30:28,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-23 12:30:28,804 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 137 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:28,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 165 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 12:30:28,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-11-23 12:30:28,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 139. [2021-11-23 12:30:28,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 133 states have (on average 1.1353383458646618) internal successors, (151), 138 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:28,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 151 transitions. [2021-11-23 12:30:28,818 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 151 transitions. Word has length 36 [2021-11-23 12:30:28,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:28,818 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 151 transitions. [2021-11-23 12:30:28,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:28,819 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 151 transitions. [2021-11-23 12:30:28,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 12:30:28,820 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:28,820 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:30:28,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-23 12:30:28,821 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:28,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:28,821 INFO L85 PathProgramCache]: Analyzing trace with hash -611243562, now seen corresponding path program 1 times [2021-11-23 12:30:28,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:28,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515998016] [2021-11-23 12:30:28,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:28,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:29,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:29,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:29,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515998016] [2021-11-23 12:30:29,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515998016] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:29,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:29,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-23 12:30:29,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998209864] [2021-11-23 12:30:29,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:29,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 12:30:29,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:29,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 12:30:29,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-23 12:30:29,154 INFO L87 Difference]: Start difference. First operand 139 states and 151 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:29,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:29,707 INFO L93 Difference]: Finished difference Result 200 states and 211 transitions. [2021-11-23 12:30:29,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 12:30:29,708 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-23 12:30:29,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:29,709 INFO L225 Difference]: With dead ends: 200 [2021-11-23 12:30:29,709 INFO L226 Difference]: Without dead ends: 159 [2021-11-23 12:30:29,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-11-23 12:30:29,711 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 332 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:29,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 484 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 12:30:29,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-11-23 12:30:29,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 136. [2021-11-23 12:30:29,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 130 states have (on average 1.1307692307692307) internal successors, (147), 135 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:29,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2021-11-23 12:30:29,727 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 36 [2021-11-23 12:30:29,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:29,728 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2021-11-23 12:30:29,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:29,728 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2021-11-23 12:30:29,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-23 12:30:29,729 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:29,729 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:30:29,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-23 12:30:29,730 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:29,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:29,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1992548114, now seen corresponding path program 1 times [2021-11-23 12:30:29,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:29,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269331684] [2021-11-23 12:30:29,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:29,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:30,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:30,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:30,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269331684] [2021-11-23 12:30:30,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269331684] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:30,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:30,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-23 12:30:30,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860630168] [2021-11-23 12:30:30,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:30,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-23 12:30:30,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:30,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-23 12:30:30,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-23 12:30:30,120 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:30,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:30,958 INFO L93 Difference]: Finished difference Result 187 states and 195 transitions. [2021-11-23 12:30:30,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-23 12:30:30,959 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-23 12:30:30,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:30,960 INFO L225 Difference]: With dead ends: 187 [2021-11-23 12:30:30,960 INFO L226 Difference]: Without dead ends: 159 [2021-11-23 12:30:30,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2021-11-23 12:30:30,962 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 355 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:30,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [355 Valid, 468 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-23 12:30:30,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-11-23 12:30:31,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 136. [2021-11-23 12:30:31,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 130 states have (on average 1.123076923076923) internal successors, (146), 135 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:31,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2021-11-23 12:30:31,008 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 36 [2021-11-23 12:30:31,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:31,008 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2021-11-23 12:30:31,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:31,008 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2021-11-23 12:30:31,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-23 12:30:31,009 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:31,009 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] [2021-11-23 12:30:31,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-23 12:30:31,010 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:31,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:31,010 INFO L85 PathProgramCache]: Analyzing trace with hash 280712196, now seen corresponding path program 1 times [2021-11-23 12:30:31,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:31,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273660123] [2021-11-23 12:30:31,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:31,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:31,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:31,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:31,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273660123] [2021-11-23 12:30:31,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273660123] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:31,247 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:31,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 12:30:31,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196574199] [2021-11-23 12:30:31,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:31,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 12:30:31,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:31,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 12:30:31,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 12:30:31,249 INFO L87 Difference]: Start difference. First operand 136 states and 146 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:31,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:31,444 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2021-11-23 12:30:31,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 12:30:31,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2021-11-23 12:30:31,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:31,446 INFO L225 Difference]: With dead ends: 136 [2021-11-23 12:30:31,446 INFO L226 Difference]: Without dead ends: 134 [2021-11-23 12:30:31,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-23 12:30:31,447 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 89 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:31,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 214 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 12:30:31,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-11-23 12:30:31,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2021-11-23 12:30:31,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.1162790697674418) internal successors, (144), 133 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-23 12:30:31,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2021-11-23 12:30:31,460 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 38 [2021-11-23 12:30:31,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:31,460 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2021-11-23 12:30:31,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:31,461 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2021-11-23 12:30:31,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-23 12:30:31,462 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:31,462 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] [2021-11-23 12:30:31,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-23 12:30:31,462 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:31,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:31,463 INFO L85 PathProgramCache]: Analyzing trace with hash -408934709, now seen corresponding path program 1 times [2021-11-23 12:30:31,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:31,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888192042] [2021-11-23 12:30:31,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:31,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:31,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:31,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:31,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888192042] [2021-11-23 12:30:31,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888192042] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:31,792 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:31,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-23 12:30:31,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991855752] [2021-11-23 12:30:31,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:31,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-23 12:30:31,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:31,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-23 12:30:31,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-23 12:30:31,794 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:32,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:32,210 INFO L93 Difference]: Finished difference Result 180 states and 187 transitions. [2021-11-23 12:30:32,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 12:30:32,212 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2021-11-23 12:30:32,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:32,213 INFO L225 Difference]: With dead ends: 180 [2021-11-23 12:30:32,213 INFO L226 Difference]: Without dead ends: 153 [2021-11-23 12:30:32,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-11-23 12:30:32,214 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 301 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:32,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 386 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 12:30:32,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-11-23 12:30:32,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 128. [2021-11-23 12:30:32,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 123 states have (on average 1.1056910569105691) internal successors, (136), 127 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-23 12:30:32,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2021-11-23 12:30:32,227 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 38 [2021-11-23 12:30:32,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:32,227 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2021-11-23 12:30:32,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:32,228 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2021-11-23 12:30:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 12:30:32,228 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:32,229 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:30:32,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-23 12:30:32,229 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:32,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:32,230 INFO L85 PathProgramCache]: Analyzing trace with hash -20265715, now seen corresponding path program 1 times [2021-11-23 12:30:32,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:32,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841387528] [2021-11-23 12:30:32,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:32,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:32,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:32,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:32,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841387528] [2021-11-23 12:30:32,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841387528] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:32,544 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:32,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-23 12:30:32,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213966312] [2021-11-23 12:30:32,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:32,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 12:30:32,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:32,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 12:30:32,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-23 12:30:32,546 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:32,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:32,937 INFO L93 Difference]: Finished difference Result 205 states and 216 transitions. [2021-11-23 12:30:32,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 12:30:32,938 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-23 12:30:32,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:32,939 INFO L225 Difference]: With dead ends: 205 [2021-11-23 12:30:32,939 INFO L226 Difference]: Without dead ends: 143 [2021-11-23 12:30:32,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-23 12:30:32,940 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 163 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:32,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 423 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 12:30:32,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-11-23 12:30:32,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 128. [2021-11-23 12:30:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 123 states have (on average 1.0975609756097562) internal successors, (135), 127 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 135 transitions. [2021-11-23 12:30:32,953 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 135 transitions. Word has length 40 [2021-11-23 12:30:32,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:32,953 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 135 transitions. [2021-11-23 12:30:32,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:32,954 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2021-11-23 12:30:32,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-23 12:30:32,954 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:32,955 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:30:32,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-23 12:30:32,955 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:32,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:32,956 INFO L85 PathProgramCache]: Analyzing trace with hash 198589003, now seen corresponding path program 1 times [2021-11-23 12:30:32,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:32,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323634891] [2021-11-23 12:30:32,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:32,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:33,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:33,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:33,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323634891] [2021-11-23 12:30:33,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323634891] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:33,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:33,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-23 12:30:33,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857996098] [2021-11-23 12:30:33,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:33,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-23 12:30:33,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:33,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-23 12:30:33,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-23 12:30:33,338 INFO L87 Difference]: Start difference. First operand 128 states and 135 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:34,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:34,142 INFO L93 Difference]: Finished difference Result 188 states and 195 transitions. [2021-11-23 12:30:34,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-23 12:30:34,143 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-23 12:30:34,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:34,145 INFO L225 Difference]: With dead ends: 188 [2021-11-23 12:30:34,145 INFO L226 Difference]: Without dead ends: 145 [2021-11-23 12:30:34,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2021-11-23 12:30:34,146 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 175 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:34,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 521 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 12:30:34,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-11-23 12:30:34,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 126. [2021-11-23 12:30:34,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 121 states have (on average 1.0826446280991735) internal successors, (131), 125 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:34,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2021-11-23 12:30:34,160 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 40 [2021-11-23 12:30:34,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:34,160 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2021-11-23 12:30:34,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:34,161 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2021-11-23 12:30:34,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-23 12:30:34,162 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:34,162 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:30:34,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-23 12:30:34,163 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:34,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:34,163 INFO L85 PathProgramCache]: Analyzing trace with hash 399724621, now seen corresponding path program 1 times [2021-11-23 12:30:34,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:34,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557711065] [2021-11-23 12:30:34,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:34,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:34,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:34,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:34,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557711065] [2021-11-23 12:30:34,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557711065] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:34,421 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:34,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-23 12:30:34,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69923736] [2021-11-23 12:30:34,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:34,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 12:30:34,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:34,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 12:30:34,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-23 12:30:34,424 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:34,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:34,664 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2021-11-23 12:30:34,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 12:30:34,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-11-23 12:30:34,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:34,667 INFO L225 Difference]: With dead ends: 141 [2021-11-23 12:30:34,667 INFO L226 Difference]: Without dead ends: 79 [2021-11-23 12:30:34,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-23 12:30:34,668 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 46 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:34,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 453 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 12:30:34,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-11-23 12:30:34,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-11-23 12:30:34,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 78 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:34,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2021-11-23 12:30:34,683 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 41 [2021-11-23 12:30:34,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:34,683 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2021-11-23 12:30:34,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:34,684 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2021-11-23 12:30:34,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 12:30:34,685 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:34,685 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:30:34,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-23 12:30:34,686 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:34,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:34,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1320234431, now seen corresponding path program 1 times [2021-11-23 12:30:34,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:34,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47252394] [2021-11-23 12:30:34,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:34,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:35,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:35,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:35,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47252394] [2021-11-23 12:30:35,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47252394] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:35,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:35,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-23 12:30:35,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625196639] [2021-11-23 12:30:35,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:35,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-23 12:30:35,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:35,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-23 12:30:35,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-23 12:30:35,490 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:35,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:35,861 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2021-11-23 12:30:35,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 12:30:35,861 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-23 12:30:35,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:35,862 INFO L225 Difference]: With dead ends: 119 [2021-11-23 12:30:35,862 INFO L226 Difference]: Without dead ends: 74 [2021-11-23 12:30:35,863 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-11-23 12:30:35,864 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 250 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:35,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 128 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 12:30:35,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-11-23 12:30:35,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-11-23 12:30:35,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2021-11-23 12:30:35,873 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 42 [2021-11-23 12:30:35,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:35,873 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2021-11-23 12:30:35,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:35,874 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2021-11-23 12:30:35,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-23 12:30:35,875 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:35,875 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:30:35,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-23 12:30:35,876 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:35,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:35,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1283557245, now seen corresponding path program 1 times [2021-11-23 12:30:35,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:35,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960576814] [2021-11-23 12:30:35,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:35,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:36,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:36,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960576814] [2021-11-23 12:30:36,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960576814] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:36,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:36,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-23 12:30:36,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644801036] [2021-11-23 12:30:36,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:36,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-23 12:30:36,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:36,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-23 12:30:36,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-11-23 12:30:36,915 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:38,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:38,033 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2021-11-23 12:30:38,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-23 12:30:38,034 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-23 12:30:38,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:38,035 INFO L225 Difference]: With dead ends: 104 [2021-11-23 12:30:38,035 INFO L226 Difference]: Without dead ends: 74 [2021-11-23 12:30:38,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2021-11-23 12:30:38,036 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 347 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:38,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 215 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-23 12:30:38,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-11-23 12:30:38,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-11-23 12:30:38,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 73 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-23 12:30:38,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2021-11-23 12:30:38,046 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 42 [2021-11-23 12:30:38,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:38,047 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2021-11-23 12:30:38,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:38,047 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2021-11-23 12:30:38,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-23 12:30:38,048 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:38,048 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:30:38,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-23 12:30:38,049 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:38,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:38,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1150640246, now seen corresponding path program 1 times [2021-11-23 12:30:38,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:38,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435162145] [2021-11-23 12:30:38,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:38,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:38,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:38,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435162145] [2021-11-23 12:30:38,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435162145] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:38,532 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:38,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-23 12:30:38,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776668816] [2021-11-23 12:30:38,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:38,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-23 12:30:38,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:38,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-23 12:30:38,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2021-11-23 12:30:38,534 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:39,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:39,230 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2021-11-23 12:30:39,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-23 12:30:39,231 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-11-23 12:30:39,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:39,232 INFO L225 Difference]: With dead ends: 74 [2021-11-23 12:30:39,232 INFO L226 Difference]: Without dead ends: 72 [2021-11-23 12:30:39,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2021-11-23 12:30:39,234 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 222 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:39,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 352 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 12:30:39,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-11-23 12:30:39,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2021-11-23 12:30:39,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 62 states have (on average 1.064516129032258) internal successors, (66), 65 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:39,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2021-11-23 12:30:39,243 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 44 [2021-11-23 12:30:39,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:39,244 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2021-11-23 12:30:39,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:39,244 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2021-11-23 12:30:39,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-23 12:30:39,245 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:39,245 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:30:39,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-23 12:30:39,246 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:39,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:39,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1943130182, now seen corresponding path program 1 times [2021-11-23 12:30:39,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:39,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589188496] [2021-11-23 12:30:39,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:39,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:39,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:39,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:39,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589188496] [2021-11-23 12:30:39,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589188496] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:39,635 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:39,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-23 12:30:39,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518769063] [2021-11-23 12:30:39,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:39,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 12:30:39,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:39,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 12:30:39,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-23 12:30:39,637 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:40,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:40,174 INFO L93 Difference]: Finished difference Result 95 states and 94 transitions. [2021-11-23 12:30:40,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 12:30:40,175 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-11-23 12:30:40,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:40,175 INFO L225 Difference]: With dead ends: 95 [2021-11-23 12:30:40,175 INFO L226 Difference]: Without dead ends: 66 [2021-11-23 12:30:40,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-11-23 12:30:40,177 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 201 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:40,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 151 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 12:30:40,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-11-23 12:30:40,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2021-11-23 12:30:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 65 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:40,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 65 transitions. [2021-11-23 12:30:40,185 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 65 transitions. Word has length 46 [2021-11-23 12:30:40,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:40,185 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 65 transitions. [2021-11-23 12:30:40,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:40,186 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 65 transitions. [2021-11-23 12:30:40,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-23 12:30:40,191 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:40,192 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:30:40,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-23 12:30:40,192 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:40,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:40,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1958810104, now seen corresponding path program 1 times [2021-11-23 12:30:40,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:40,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015082712] [2021-11-23 12:30:40,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:40,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:40,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:40,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:40,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015082712] [2021-11-23 12:30:40,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015082712] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:40,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:40,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-23 12:30:40,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564659079] [2021-11-23 12:30:40,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:40,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 12:30:40,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:40,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 12:30:40,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-23 12:30:40,858 INFO L87 Difference]: Start difference. First operand 66 states and 65 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:41,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:41,290 INFO L93 Difference]: Finished difference Result 66 states and 65 transitions. [2021-11-23 12:30:41,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 12:30:41,291 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-11-23 12:30:41,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:41,292 INFO L225 Difference]: With dead ends: 66 [2021-11-23 12:30:41,292 INFO L226 Difference]: Without dead ends: 64 [2021-11-23 12:30:41,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2021-11-23 12:30:41,293 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 222 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:41,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 167 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 12:30:41,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-11-23 12:30:41,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-11-23 12:30:41,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 63 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:41,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 63 transitions. [2021-11-23 12:30:41,302 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 63 transitions. Word has length 46 [2021-11-23 12:30:41,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:41,303 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 63 transitions. [2021-11-23 12:30:41,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:41,303 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 63 transitions. [2021-11-23 12:30:41,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-23 12:30:41,304 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:41,304 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] [2021-11-23 12:30:41,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-23 12:30:41,305 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:41,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:41,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1220963354, now seen corresponding path program 1 times [2021-11-23 12:30:41,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:41,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300378433] [2021-11-23 12:30:41,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:41,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:41,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:41,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:41,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300378433] [2021-11-23 12:30:41,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300378433] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:41,994 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:41,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-23 12:30:41,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251252500] [2021-11-23 12:30:41,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:41,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 12:30:41,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:41,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 12:30:41,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-23 12:30:41,996 INFO L87 Difference]: Start difference. First operand 64 states and 63 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:42,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:42,425 INFO L93 Difference]: Finished difference Result 64 states and 63 transitions. [2021-11-23 12:30:42,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 12:30:42,425 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2021-11-23 12:30:42,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:42,426 INFO L225 Difference]: With dead ends: 64 [2021-11-23 12:30:42,426 INFO L226 Difference]: Without dead ends: 62 [2021-11-23 12:30:42,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2021-11-23 12:30:42,428 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 159 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:42,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 161 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 12:30:42,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-11-23 12:30:42,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-11-23 12:30:42,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 61 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:42,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 61 transitions. [2021-11-23 12:30:42,438 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 61 transitions. Word has length 48 [2021-11-23 12:30:42,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:42,438 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 61 transitions. [2021-11-23 12:30:42,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:42,439 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 61 transitions. [2021-11-23 12:30:42,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-23 12:30:42,440 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:42,440 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] [2021-11-23 12:30:42,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-23 12:30:42,440 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:42,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:42,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1599746443, now seen corresponding path program 1 times [2021-11-23 12:30:42,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:42,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540304102] [2021-11-23 12:30:42,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:42,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:42,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:42,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:42,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540304102] [2021-11-23 12:30:42,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540304102] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:42,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:42,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-23 12:30:42,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526330718] [2021-11-23 12:30:42,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:42,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-23 12:30:42,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:42,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-23 12:30:42,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-23 12:30:42,990 INFO L87 Difference]: Start difference. First operand 62 states and 61 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:43,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:43,279 INFO L93 Difference]: Finished difference Result 62 states and 61 transitions. [2021-11-23 12:30:43,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 12:30:43,280 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2021-11-23 12:30:43,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:43,280 INFO L225 Difference]: With dead ends: 62 [2021-11-23 12:30:43,280 INFO L226 Difference]: Without dead ends: 60 [2021-11-23 12:30:43,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-11-23 12:30:43,282 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 150 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:43,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 196 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 12:30:43,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-11-23 12:30:43,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-11-23 12:30:43,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.0) internal successors, (59), 59 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 59 transitions. [2021-11-23 12:30:43,289 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 59 transitions. Word has length 53 [2021-11-23 12:30:43,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:43,289 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 59 transitions. [2021-11-23 12:30:43,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:43,290 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 59 transitions. [2021-11-23 12:30:43,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-23 12:30:43,291 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 12:30:43,291 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:30:43,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-23 12:30:43,292 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-23 12:30:43,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 12:30:43,292 INFO L85 PathProgramCache]: Analyzing trace with hash 926142011, now seen corresponding path program 1 times [2021-11-23 12:30:43,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 12:30:43,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789332145] [2021-11-23 12:30:43,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 12:30:43,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 12:30:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 12:30:45,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 12:30:45,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 12:30:45,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789332145] [2021-11-23 12:30:45,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789332145] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 12:30:45,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 12:30:45,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-23 12:30:45,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731787930] [2021-11-23 12:30:45,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 12:30:45,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-23 12:30:45,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 12:30:45,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-23 12:30:45,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-23 12:30:45,296 INFO L87 Difference]: Start difference. First operand 60 states and 59 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:45,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 12:30:45,650 INFO L93 Difference]: Finished difference Result 60 states and 59 transitions. [2021-11-23 12:30:45,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 12:30:45,651 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-23 12:30:45,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 12:30:45,651 INFO L225 Difference]: With dead ends: 60 [2021-11-23 12:30:45,651 INFO L226 Difference]: Without dead ends: 0 [2021-11-23 12:30:45,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2021-11-23 12:30:45,653 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 138 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 12:30:45,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 222 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 12:30:45,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-23 12:30:45,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-23 12:30:45,654 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-23 12:30:45,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-23 12:30:45,654 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2021-11-23 12:30:45,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 12:30:45,655 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-23 12:30:45,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 12:30:45,655 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-23 12:30:45,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-23 12:30:45,658 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-11-23 12:30:45,659 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-11-23 12:30:45,659 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2021-11-23 12:30:45,660 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2021-11-23 12:30:45,660 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2021-11-23 12:30:45,660 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2021-11-23 12:30:45,661 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-11-23 12:30:45,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-23 12:30:45,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-23 12:31:34,522 WARN L227 SmtUtils]: Spent 48.85s on a formula simplification. DAG size of input: 213 DAG size of output: 203 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-23 12:31:41,518 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-23 12:31:41,518 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-23 12:31:41,518 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-23 12:31:41,518 INFO L858 garLoopResultBuilder]: For program point L8974-2(lines 8974 8976) no Hoare annotation was computed. [2021-11-23 12:31:41,519 INFO L858 garLoopResultBuilder]: For program point L8974(lines 8974 8976) no Hoare annotation was computed. [2021-11-23 12:31:41,519 INFO L854 garLoopResultBuilder]: At program point L8215(lines 8203 8216) the Hoare annotation is: (let ((.cse18 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|))) (let ((.cse5 (select .cse18 |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)) (.cse16 (select .cse18 (+ 16 |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|))) (.cse17 (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_~len#1| 18446744073709551616)))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_array_#res#1.buffer.offset| 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_from_array_~len#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse2 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse3 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) (.cse4 (<= |ULTIMATE.start_aws_byte_buf_from_array_~len#1| (+ .cse17 36028797018963967))) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse7 (= |ULTIMATE.start_bounded_malloc_~size#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse8 (<= .cse5 .cse16)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse10 (<= .cse16 .cse5)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_array_#res#1.allocator.offset| 0)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_buf_from_array_#res#1.len|)) (.cse14 (not (= |ULTIMATE.start_aws_byte_buf_from_array_~bytes#1.base| 0))) (.cse15 (= |ULTIMATE.start_aws_byte_buf_from_array_#res#1.allocator.base| 0))) (or (and .cse0 (= 0 |ULTIMATE.start_aws_byte_buf_from_array_#res#1.buffer.base|) .cse1 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616))) .cse2 .cse3 .cse4 (<= .cse5 (* 18446744073709551616 (div .cse5 18446744073709551616))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 (= |ULTIMATE.start_aws_byte_buf_from_array_~bytes#1.offset| 0) .cse1 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) .cse2 .cse3 .cse4 .cse6 .cse7 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_buf_from_array_~bytes#1.base|) .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse16 (+ (* 18446744073709551616 (div (+ (- 1) .cse16) 18446744073709551616)) 18446744073709551615)) .cse13 .cse14 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_buf_from_array_#res#1.buffer.base|) .cse15 (<= (+ .cse17 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)))))) [2021-11-23 12:31:41,519 INFO L858 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-23 12:31:41,519 INFO L858 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-23 12:31:41,519 INFO L858 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-23 12:31:41,519 INFO L858 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-11-23 12:31:41,519 INFO L858 garLoopResultBuilder]: For program point L8959(lines 8959 8977) no Hoare annotation was computed. [2021-11-23 12:31:41,519 INFO L858 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-11-23 12:31:41,520 INFO L858 garLoopResultBuilder]: For program point L222-5(lines 222 224) no Hoare annotation was computed. [2021-11-23 12:31:41,520 INFO L858 garLoopResultBuilder]: For program point L222-6(lines 222 224) no Hoare annotation was computed. [2021-11-23 12:31:41,520 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-23 12:31:41,520 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-23 12:31:41,520 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-23 12:31:41,520 INFO L858 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-23 12:31:41,520 INFO L858 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-23 12:31:41,520 INFO L858 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-23 12:31:41,520 INFO L858 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-23 12:31:41,520 INFO L858 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-11-23 12:31:41,521 INFO L858 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-11-23 12:31:41,521 INFO L858 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-11-23 12:31:41,521 INFO L858 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-11-23 12:31:41,521 INFO L858 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-11-23 12:31:41,521 INFO L858 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-11-23 12:31:41,521 INFO L858 garLoopResultBuilder]: For program point L223-18(line 223) no Hoare annotation was computed. [2021-11-23 12:31:41,521 INFO L858 garLoopResultBuilder]: For program point L223-19(line 223) no Hoare annotation was computed. [2021-11-23 12:31:41,521 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-23 12:31:41,521 INFO L861 garLoopResultBuilder]: At program point L8978(line 8978) the Hoare annotation is: true [2021-11-23 12:31:41,522 INFO L858 garLoopResultBuilder]: For program point L7377-3(line 7377) no Hoare annotation was computed. [2021-11-23 12:31:41,522 INFO L858 garLoopResultBuilder]: For program point L7377-1(line 7377) no Hoare annotation was computed. [2021-11-23 12:31:41,522 INFO L858 garLoopResultBuilder]: For program point L7377(lines 7377 7380) no Hoare annotation was computed. [2021-11-23 12:31:41,522 INFO L858 garLoopResultBuilder]: For program point L7377-7(lines 7377 7380) no Hoare annotation was computed. [2021-11-23 12:31:41,522 INFO L858 garLoopResultBuilder]: For program point L7377-6(lines 7377 7378) no Hoare annotation was computed. [2021-11-23 12:31:41,523 INFO L858 garLoopResultBuilder]: For program point L7377-4(lines 7377 7378) no Hoare annotation was computed. [2021-11-23 12:31:41,523 INFO L858 garLoopResultBuilder]: For program point L7377-11(lines 7377 7380) no Hoare annotation was computed. [2021-11-23 12:31:41,523 INFO L858 garLoopResultBuilder]: For program point L7377-9(lines 7377 7380) no Hoare annotation was computed. [2021-11-23 12:31:41,523 INFO L858 garLoopResultBuilder]: For program point L7377-14(line 7377) no Hoare annotation was computed. [2021-11-23 12:31:41,523 INFO L858 garLoopResultBuilder]: For program point L7377-13(lines 7377 7380) no Hoare annotation was computed. [2021-11-23 12:31:41,523 INFO L854 garLoopResultBuilder]: At program point L7377-12(lines 7375 7381) the Hoare annotation is: (let ((.cse28 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|))) (let ((.cse23 (select .cse28 |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|)) (.cse22 (select .cse28 (+ 16 |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|))) (.cse24 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1#1.base|)) (.cse21 (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_~len#1| 18446744073709551616))) (.cse25 (+ |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1#1.offset| 24)) (.cse27 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1#1.base|)) (.cse26 (+ |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1#1.offset| 8))) (let ((.cse0 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 1)) (.cse1 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res#1|)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_from_array_~len#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1#1.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|)) (.cse4 (= (select .cse27 .cse26) 0)) (.cse5 (= (select .cse27 .cse25) 0)) (.cse7 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse8 (<= |ULTIMATE.start_bounded_malloc_~size#1| (+ (* 18446744073709551616 (div |ULTIMATE.start_bounded_malloc_~size#1| 18446744073709551616)) 36028797018963967))) (.cse9 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) (.cse10 (<= |ULTIMATE.start_aws_byte_buf_from_array_~len#1| (+ .cse21 36028797018963967))) (.cse6 (select .cse24 .cse26)) (.cse11 (= |ULTIMATE.start_bounded_malloc_~size#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse12 (<= .cse23 .cse22)) (.cse13 (= (select .cse24 .cse25) 0)) (.cse14 (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse15 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse16 (<= .cse22 .cse23)) (.cse17 (= |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0)) (.cse18 (= |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1#1.offset| 0)) (.cse19 (not (= |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1#1.base| 0))) (.cse20 (not (= |ULTIMATE.start_aws_byte_buf_from_array_~bytes#1.base| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616))) .cse4 .cse5 (= .cse6 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 (= |ULTIMATE.start_aws_byte_buf_from_array_~bytes#1.offset| 0) .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) .cse5 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse6) .cse11 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_buf_from_array_~bytes#1.base|) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= (+ .cse21 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)))))) [2021-11-23 12:31:41,523 INFO L858 garLoopResultBuilder]: For program point L7377-19(lines 7377 7378) no Hoare annotation was computed. [2021-11-23 12:31:41,523 INFO L858 garLoopResultBuilder]: For program point L7377-17(lines 7377 7378) no Hoare annotation was computed. [2021-11-23 12:31:41,524 INFO L858 garLoopResultBuilder]: For program point L7377-16(line 7377) no Hoare annotation was computed. [2021-11-23 12:31:41,524 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-23 12:31:41,524 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-23 12:31:41,524 INFO L858 garLoopResultBuilder]: For program point L7377-22(lines 7377 7380) no Hoare annotation was computed. [2021-11-23 12:31:41,524 INFO L858 garLoopResultBuilder]: For program point L7377-20(lines 7377 7380) no Hoare annotation was computed. [2021-11-23 12:31:41,525 INFO L854 garLoopResultBuilder]: At program point L7377-25(lines 7375 7381) the Hoare annotation is: (let ((.cse24 (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_~len#1| 18446744073709551616))) (.cse27 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse25 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse26 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse28 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse29 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_array_#res#1.buffer.offset| 0)) (.cse1 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 1)) (.cse2 (= (select .cse28 .cse29) 0)) (.cse3 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res#1|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_array_~len#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse5 (= (select .cse26 .cse29) 0)) (.cse6 (= (select .cse25 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse9 (<= |ULTIMATE.start_bounded_malloc_~size#1| (+ (* 18446744073709551616 (div |ULTIMATE.start_bounded_malloc_~size#1| 18446744073709551616)) 36028797018963967))) (.cse20 (select .cse28 .cse27)) (.cse10 (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0))) (.cse11 (<= |ULTIMATE.start_aws_byte_buf_from_array_~len#1| (+ .cse24 36028797018963967))) (.cse12 (= (select .cse26 .cse27) 0)) (.cse13 (= (select .cse25 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse15 (= |ULTIMATE.start_aws_byte_buf_from_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse16 (= |ULTIMATE.start_bounded_malloc_~size#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse17 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse18 (= |ULTIMATE.start_aws_byte_buf_from_array_#res#1.allocator.offset| 0)) (.cse19 (= |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0)) (.cse21 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_buf_from_array_#res#1.len|)) (.cse22 (not (= |ULTIMATE.start_aws_byte_buf_from_array_~bytes#1.base| 0))) (.cse23 (= |ULTIMATE.start_aws_byte_buf_from_array_#res#1.allocator.base| 0))) (or (let ((.cse7 (+ 8 |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|))) (and .cse0 .cse1 .cse2 (= 0 |ULTIMATE.start_aws_byte_buf_from_array_#res#1.buffer.base|) .cse3 .cse4 .cse5 .cse6 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) .cse7) 0) .cse8 .cse9 .cse10 .cse11 (<= |ULTIMATE.start_aws_byte_buf_from_array_#res#1.len| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_#res#1.len| 18446744073709551616))) .cse12 .cse13 (let ((.cse14 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset|))) (<= .cse14 (* 18446744073709551616 (div .cse14 18446744073709551616)))) .cse15 .cse16 .cse17 .cse18 .cse19 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) .cse7) 0) (= .cse20 0) .cse21 .cse22 .cse23)) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_aws_byte_buf_from_array_~bytes#1.offset| 0) .cse3 .cse4 .cse5 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) .cse6 .cse8 .cse9 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse20) .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_buf_from_array_~bytes#1.base|) .cse17 .cse18 .cse19 .cse21 .cse22 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_buf_from_array_#res#1.buffer.base|) .cse23 (<= (+ .cse24 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|))))) [2021-11-23 12:31:41,525 INFO L858 garLoopResultBuilder]: For program point L7377-24(lines 7377 7380) no Hoare annotation was computed. [2021-11-23 12:31:41,525 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-23 12:31:41,525 INFO L858 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-23 12:31:41,525 INFO L858 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-23 12:31:41,526 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-23 12:31:41,526 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-23 12:31:41,526 INFO L858 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-23 12:31:41,526 INFO L858 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-23 12:31:41,526 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-11-23 12:31:41,527 INFO L858 garLoopResultBuilder]: For program point L7380-2(line 7380) no Hoare annotation was computed. [2021-11-23 12:31:41,527 INFO L858 garLoopResultBuilder]: For program point L7380(line 7380) no Hoare annotation was computed. [2021-11-23 12:31:41,527 INFO L858 garLoopResultBuilder]: For program point L8206(lines 8206 8207) no Hoare annotation was computed. [2021-11-23 12:31:41,527 INFO L858 garLoopResultBuilder]: For program point L7380-6(line 7380) no Hoare annotation was computed. [2021-11-23 12:31:41,527 INFO L858 garLoopResultBuilder]: For program point L7380-4(line 7380) no Hoare annotation was computed. [2021-11-23 12:31:41,528 INFO L858 garLoopResultBuilder]: For program point L7380-3(line 7380) no Hoare annotation was computed. [2021-11-23 12:31:41,528 INFO L858 garLoopResultBuilder]: For program point L7380-9(line 7380) no Hoare annotation was computed. [2021-11-23 12:31:41,528 INFO L858 garLoopResultBuilder]: For program point L8206-2(lines 8206 8207) no Hoare annotation was computed. [2021-11-23 12:31:41,528 INFO L858 garLoopResultBuilder]: For program point L7380-8(line 7380) no Hoare annotation was computed. [2021-11-23 12:31:41,528 INFO L858 garLoopResultBuilder]: For program point L7380-13(line 7380) no Hoare annotation was computed. [2021-11-23 12:31:41,529 INFO L858 garLoopResultBuilder]: For program point L7380-12(line 7380) no Hoare annotation was computed. [2021-11-23 12:31:41,529 INFO L858 garLoopResultBuilder]: For program point L7380-11(line 7380) no Hoare annotation was computed. [2021-11-23 12:31:41,529 INFO L858 garLoopResultBuilder]: For program point L7380-17(line 7380) no Hoare annotation was computed. [2021-11-23 12:31:41,529 INFO L858 garLoopResultBuilder]: For program point L7380-15(line 7380) no Hoare annotation was computed. [2021-11-23 12:31:41,529 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-23 12:31:41,530 INFO L854 garLoopResultBuilder]: At program point L6886(lines 6882 6887) the Hoare annotation is: (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) (<= |ULTIMATE.start_bounded_malloc_~size#1| (+ (* 18446744073709551616 (div |ULTIMATE.start_bounded_malloc_~size#1| 18446744073709551616)) 36028797018963967)) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (= |ULTIMATE.start_bounded_malloc_~size#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) [2021-11-23 12:31:41,530 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-23 12:31:41,530 INFO L858 garLoopResultBuilder]: For program point L7101(lines 7101 7111) no Hoare annotation was computed. [2021-11-23 12:31:41,530 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-23 12:31:41,531 INFO L854 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse4 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse3 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse5 (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_~len#1| 18446744073709551616)))) (and (= |ULTIMATE.start_aws_byte_buf_from_array_#res#1.buffer.offset| 0) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res#1| 1) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select .cse0 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_~bytes#1.offset| 0) (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res#1|) (= |ULTIMATE.start_aws_byte_buf_from_array_~len#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= (select .cse2 .cse1) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|) (= |ULTIMATE.start_bounded_malloc_#res#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.base|) (= (select .cse3 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| (select .cse0 .cse4)) (not (= |ULTIMATE.start_bounded_malloc_#res#1.base| 0)) (<= |ULTIMATE.start_aws_byte_buf_from_array_~len#1| (+ .cse5 36028797018963967)) (= (select .cse2 .cse4) 0) (= (select .cse3 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_buf_from_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_bounded_malloc_~size#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_buf_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_is_valid_~buf#1.offset| 0) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_buf_from_array_#res#1.len|) (not (= |ULTIMATE.start_aws_byte_buf_from_array_~bytes#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_buf_from_array_#res#1.buffer.base|) (<= (div |ULTIMATE.start___VERIFIER_assert_~cond#1| 256) 0) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_array_#res#1.allocator.base| 0) (<= (+ .cse5 1) |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|))) [2021-11-23 12:31:41,535 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 12:31:41,537 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-23 12:31:41,549 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,551 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:41,551 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:41,552 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:41,552 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:41,553 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,554 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,554 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,562 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,563 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:41,563 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:41,564 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:41,564 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:41,565 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,565 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,565 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,570 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:41,571 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:41,571 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:41,572 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:41,578 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:41,578 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:41,579 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:41,579 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:41,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:41,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:41,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:41,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:41,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:41,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:41,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:41,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:41,591 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,592 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:41,592 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,592 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:41,593 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:41,594 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:41,594 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,594 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:41,595 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:41,595 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,595 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,596 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:41,596 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:41,597 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:41,597 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:41,598 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,598 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,599 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,608 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,609 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:41,609 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,610 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:41,610 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:41,611 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:41,611 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,626 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:41,626 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:41,626 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,626 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,627 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:41,627 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:41,628 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:41,628 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:41,629 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,629 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,629 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,633 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,633 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,634 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,634 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,635 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,635 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,636 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,636 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,638 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,639 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,639 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,639 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,640 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,640 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,641 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,641 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:41,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:31:41 BoogieIcfgContainer [2021-11-23 12:31:41,643 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-23 12:31:41,644 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 12:31:41,644 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 12:31:41,645 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 12:31:41,645 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:30:12" (3/4) ... [2021-11-23 12:31:41,649 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-23 12:31:41,685 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 128 nodes and edges [2021-11-23 12:31:41,688 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2021-11-23 12:31:41,690 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-11-23 12:31:41,692 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-23 12:31:41,695 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-23 12:31:41,697 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-23 12:31:41,700 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-23 12:31:41,702 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-23 12:31:41,753 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((cond == 1 && \result == 0) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0)) && size == length [2021-11-23 12:31:41,754 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((\result <= 1 && 1 <= \result) && len == length) && buf == buf) && length <= 18446744073709551616 * (length / 18446744073709551616)) && #memory_$Pointer$[buf][buf + 8] == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && !(buf == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && size == length) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16 + buf]) && #memory_$Pointer$[buf][buf + 24] == 0) && unknown-#memory_int-unknown[buf][16 + buf] == length) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= unknown-#memory_int-unknown[buf][buf]) && buf == 0) && buf == 0) && !(buf == 0)) && !(bytes == 0)) || (((((((((((((((((((((((((\result <= 1 && bytes == 0) && 1 <= \result) && len == length) && buf == buf) && #memory_$Pointer$[buf][buf + 8] == 0) && array == 0) && \result == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && !(buf == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && array == #memory_$Pointer$[buf][buf + 8]) && size == length) && array == bytes) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16 + buf]) && #memory_$Pointer$[buf][buf + 24] == 0) && unknown-#memory_int-unknown[buf][16 + buf] == length) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= unknown-#memory_int-unknown[buf][buf]) && buf == 0) && buf == 0) && !(buf == 0)) && !(bytes == 0)) && 18446744073709551616 * (len / 18446744073709551616) + 1 <= length) [2021-11-23 12:31:41,755 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((aws_byte_buf_from_array_#res#1.buffer == 0 && 0 == aws_byte_buf_from_array_#res#1.buffer) && len == length) && length <= 18446744073709551616 * (length / 18446744073709551616)) && !(buf == 0)) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && unknown-#memory_int-unknown[buf][buf] <= 18446744073709551616 * (unknown-#memory_int-unknown[buf][buf] / 18446744073709551616)) && unknown-#res!capacity-unknown == length) && size == length) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16 + buf]) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= unknown-#memory_int-unknown[buf][buf]) && aws_byte_buf_from_array_#res#1.allocator == 0) && buf == 0) && length == unknown-#res!len-unknown) && !(bytes == 0)) && aws_byte_buf_from_array_#res#1.allocator == 0) || (((((((((((((((((((((aws_byte_buf_from_array_#res#1.buffer == 0 && bytes == 0) && len == length) && array == 0) && \result == 0) && !(buf == 0)) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && unknown-#res!capacity-unknown == length) && size == length) && array == bytes) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16 + buf]) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= unknown-#memory_int-unknown[buf][buf]) && aws_byte_buf_from_array_#res#1.allocator == 0) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616) + 18446744073709551615) && length == unknown-#res!len-unknown) && !(bytes == 0)) && array == aws_byte_buf_from_array_#res#1.buffer) && aws_byte_buf_from_array_#res#1.allocator == 0) && 18446744073709551616 * (len / 18446744073709551616) + 1 <= length) [2021-11-23 12:31:41,755 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((aws_byte_buf_from_array_#res#1.buffer == 0 && \result <= 1) && #memory_$Pointer$[buf][buf + 24] == 0) && 0 == aws_byte_buf_from_array_#res#1.buffer) && 1 <= \result) && len == length) && #memory_$Pointer$[buf][buf + 24] == 0) && unknown-#memory_int-unknown[buf][16 + buf] == length) && #memory_$Pointer$[buf][8 + buf] == 0) && !(buf == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && unknown-#res!len-unknown <= 18446744073709551616 * (unknown-#res!len-unknown / 18446744073709551616)) && #memory_$Pointer$[buf][buf + 8] == 0) && unknown-#memory_int-unknown[buf][buf] == length) && unknown-#memory_int-unknown[buf][buf] <= 18446744073709551616 * (unknown-#memory_int-unknown[buf][buf] / 18446744073709551616)) && unknown-#res!capacity-unknown == length) && size == length) && buf == 0) && aws_byte_buf_from_array_#res#1.allocator == 0) && buf == 0) && #memory_$Pointer$[buf][8 + buf] == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && length == unknown-#res!len-unknown) && !(bytes == 0)) && aws_byte_buf_from_array_#res#1.allocator == 0) || ((((((((((((((((((((((((((((aws_byte_buf_from_array_#res#1.buffer == 0 && \result <= 1) && #memory_$Pointer$[buf][buf + 24] == 0) && bytes == 0) && 1 <= \result) && len == length) && #memory_$Pointer$[buf][buf + 24] == 0) && array == 0) && \result == 0) && buf == buf) && unknown-#memory_int-unknown[buf][16 + buf] == length) && !(buf == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && array == #memory_$Pointer$[buf][buf + 8]) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && #memory_$Pointer$[buf][buf + 8] == 0) && unknown-#memory_int-unknown[buf][buf] == length) && unknown-#res!capacity-unknown == length) && size == length) && array == bytes) && buf == 0) && aws_byte_buf_from_array_#res#1.allocator == 0) && buf == 0) && length == unknown-#res!len-unknown) && !(bytes == 0)) && array == aws_byte_buf_from_array_#res#1.buffer) && aws_byte_buf_from_array_#res#1.allocator == 0) && 18446744073709551616 * (len / 18446744073709551616) + 1 <= length) [2021-11-23 12:31:41,756 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((aws_byte_buf_from_array_#res#1.buffer == 0 && \result <= 1) && b == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && bytes == 0) && 1 <= \result) && len == length) && #memory_$Pointer$[buf][buf + 24] == 0) && array == 0) && 1 <= cond) && \result == 0) && buf == buf) && unknown-#memory_int-unknown[buf][16 + buf] == length) && !(buf == 0)) && array == #memory_$Pointer$[buf][buf + 8]) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && #memory_$Pointer$[buf][buf + 8] == 0) && unknown-#memory_int-unknown[buf][buf] == length) && unknown-#res!capacity-unknown == length) && size == length) && array == bytes) && buf == 0) && aws_byte_buf_from_array_#res#1.allocator == 0) && buf == 0) && b == a) && length == unknown-#res!len-unknown) && !(bytes == 0)) && array == aws_byte_buf_from_array_#res#1.buffer) && cond / 256 <= 0) && a == 0) && aws_byte_buf_from_array_#res#1.allocator == 0) && 18446744073709551616 * (len / 18446744073709551616) + 1 <= length [2021-11-23 12:31:42,798 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dacce6-7352-4e57-b8e7-526316686769/bin/uautomizer-wIGwrQj20G/witness.graphml [2021-11-23 12:31:42,798 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 12:31:42,799 INFO L158 Benchmark]: Toolchain (without parser) took 97120.00ms. Allocated memory was 115.3MB in the beginning and 465.6MB in the end (delta: 350.2MB). Free memory was 88.0MB in the beginning and 164.6MB in the end (delta: -76.6MB). Peak memory consumption was 330.1MB. Max. memory is 16.1GB. [2021-11-23 12:31:42,800 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 90.2MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 12:31:42,800 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3804.22ms. Allocated memory was 115.3MB in the beginning and 174.1MB in the end (delta: 58.7MB). Free memory was 87.5MB in the beginning and 82.3MB in the end (delta: 5.2MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2021-11-23 12:31:42,801 INFO L158 Benchmark]: Boogie Procedure Inliner took 391.24ms. Allocated memory is still 174.1MB. Free memory was 82.3MB in the beginning and 113.8MB in the end (delta: -31.5MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2021-11-23 12:31:42,801 INFO L158 Benchmark]: Boogie Preprocessor took 131.41ms. Allocated memory is still 174.1MB. Free memory was 113.8MB in the beginning and 107.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-23 12:31:42,802 INFO L158 Benchmark]: RCFGBuilder took 2530.59ms. Allocated memory is still 174.1MB. Free memory was 107.5MB in the beginning and 84.8MB in the end (delta: 22.7MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. [2021-11-23 12:31:42,802 INFO L158 Benchmark]: TraceAbstraction took 89100.65ms. Allocated memory was 174.1MB in the beginning and 465.6MB in the end (delta: 291.5MB). Free memory was 84.8MB in the beginning and 167.2MB in the end (delta: -82.4MB). Peak memory consumption was 250.4MB. Max. memory is 16.1GB. [2021-11-23 12:31:42,802 INFO L158 Benchmark]: Witness Printer took 1154.29ms. Allocated memory is still 465.6MB. Free memory was 167.2MB in the beginning and 164.6MB in the end (delta: 2.6MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. [2021-11-23 12:31:42,805 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.36ms. Allocated memory is still 90.2MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3804.22ms. Allocated memory was 115.3MB in the beginning and 174.1MB in the end (delta: 58.7MB). Free memory was 87.5MB in the beginning and 82.3MB in the end (delta: 5.2MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 391.24ms. Allocated memory is still 174.1MB. Free memory was 82.3MB in the beginning and 113.8MB in the end (delta: -31.5MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 131.41ms. Allocated memory is still 174.1MB. Free memory was 113.8MB in the beginning and 107.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2530.59ms. Allocated memory is still 174.1MB. Free memory was 107.5MB in the beginning and 84.8MB in the end (delta: 22.7MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. * TraceAbstraction took 89100.65ms. Allocated memory was 174.1MB in the beginning and 465.6MB in the end (delta: 291.5MB). Free memory was 84.8MB in the beginning and 167.2MB in the end (delta: -82.4MB). Peak memory consumption was 250.4MB. Max. memory is 16.1GB. * Witness Printer took 1154.29ms. Allocated memory is still 465.6MB. Free memory was 167.2MB in the beginning and 164.6MB in the end (delta: 2.6MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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$.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$.offset - 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$.offset - 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$.offset - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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$.offset - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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$.offset - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - 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$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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, 79 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 88.9s, OverallIterations: 35, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 15.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 55.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6744 SdHoareTripleChecker+Valid, 9.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6744 mSDsluCounter, 11405 SdHoareTripleChecker+Invalid, 8.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8737 mSDsCounter, 397 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3980 IncrementalHoareTripleChecker+Invalid, 4377 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 397 mSolverCounterUnsat, 2668 mSDtfsCounter, 3980 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 519 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 420 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=18, InterpolantAutomatonStates: 334, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 35 MinimizatonAttempts, 935 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 990 HoareAnnotationTreeSize, 6 FomulaSimplifications, 1434580 FormulaSimplificationTreeSizeReduction, 52.6s HoareSimplificationTime, 6 FomulaSimplificationsInter, 706010 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 7.2s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 1163 NumberOfCodeBlocks, 1163 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1128 ConstructedInterpolants, 0 QuantifiedInterpolants, 11516 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 266]: Loop Invariant [2021-11-23 12:31:42,842 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,842 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:42,843 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:42,843 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:42,844 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:42,845 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,850 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,850 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,851 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,853 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:42,853 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:42,853 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:42,854 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:42,854 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,855 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,855 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled Derived loop invariant: (((((((((((((((((((((((((((((((aws_byte_buf_from_array_#res#1.buffer == 0 && \result <= 1) && b == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && bytes == 0) && 1 <= \result) && len == length) && #memory_$Pointer$[buf][buf + 24] == 0) && array == 0) && 1 <= cond) && \result == 0) && buf == buf) && unknown-#memory_int-unknown[buf][16 + buf] == length) && !(buf == 0)) && array == #memory_$Pointer$[buf][buf + 8]) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && #memory_$Pointer$[buf][buf + 8] == 0) && unknown-#memory_int-unknown[buf][buf] == length) && unknown-#res!capacity-unknown == length) && size == length) && array == bytes) && buf == 0) && aws_byte_buf_from_array_#res#1.allocator == 0) && buf == 0) && b == a) && length == unknown-#res!len-unknown) && !(bytes == 0)) && array == aws_byte_buf_from_array_#res#1.buffer) && cond / 256 <= 0) && a == 0) && aws_byte_buf_from_array_#res#1.allocator == 0) && 18446744073709551616 * (len / 18446744073709551616) + 1 <= length - InvariantResult [Line: 7375]: Loop Invariant [2021-11-23 12:31:42,856 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:42,857 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:42,857 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:42,857 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:42,858 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:42,858 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:42,858 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:42,859 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:42,863 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:42,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:42,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:42,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:42,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:42,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:42,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:42,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((\result <= 1 && 1 <= \result) && len == length) && buf == buf) && length <= 18446744073709551616 * (length / 18446744073709551616)) && #memory_$Pointer$[buf][buf + 8] == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && !(buf == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && size == length) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16 + buf]) && #memory_$Pointer$[buf][buf + 24] == 0) && unknown-#memory_int-unknown[buf][16 + buf] == length) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= unknown-#memory_int-unknown[buf][buf]) && buf == 0) && buf == 0) && !(buf == 0)) && !(bytes == 0)) || (((((((((((((((((((((((((\result <= 1 && bytes == 0) && 1 <= \result) && len == length) && buf == buf) && #memory_$Pointer$[buf][buf + 8] == 0) && array == 0) && \result == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && !(buf == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && array == #memory_$Pointer$[buf][buf + 8]) && size == length) && array == bytes) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16 + buf]) && #memory_$Pointer$[buf][buf + 24] == 0) && unknown-#memory_int-unknown[buf][16 + buf] == length) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= unknown-#memory_int-unknown[buf][buf]) && buf == 0) && buf == 0) && !(buf == 0)) && !(bytes == 0)) && 18446744073709551616 * (len / 18446744073709551616) + 1 <= length) - InvariantResult [Line: 6882]: Loop Invariant Derived loop invariant: (((cond == 1 && \result == 0) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0)) && size == length - InvariantResult [Line: 7375]: Loop Invariant [2021-11-23 12:31:42,868 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:42,869 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:42,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:42,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:42,871 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,871 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:42,872 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:42,872 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,873 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:42,875 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:42,876 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:42,876 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:42,876 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,876 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,877 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,878 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,879 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:42,879 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,880 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:42,881 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:42,881 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:42,882 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:42,882 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:42,882 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,883 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:42,883 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:42,884 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-23 12:31:42,884 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-23 12:31:42,885 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,885 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,885 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled Derived loop invariant: ((((((((((((((((((((((((((aws_byte_buf_from_array_#res#1.buffer == 0 && \result <= 1) && #memory_$Pointer$[buf][buf + 24] == 0) && 0 == aws_byte_buf_from_array_#res#1.buffer) && 1 <= \result) && len == length) && #memory_$Pointer$[buf][buf + 24] == 0) && unknown-#memory_int-unknown[buf][16 + buf] == length) && #memory_$Pointer$[buf][8 + buf] == 0) && !(buf == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && unknown-#res!len-unknown <= 18446744073709551616 * (unknown-#res!len-unknown / 18446744073709551616)) && #memory_$Pointer$[buf][buf + 8] == 0) && unknown-#memory_int-unknown[buf][buf] == length) && unknown-#memory_int-unknown[buf][buf] <= 18446744073709551616 * (unknown-#memory_int-unknown[buf][buf] / 18446744073709551616)) && unknown-#res!capacity-unknown == length) && size == length) && buf == 0) && aws_byte_buf_from_array_#res#1.allocator == 0) && buf == 0) && #memory_$Pointer$[buf][8 + buf] == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && length == unknown-#res!len-unknown) && !(bytes == 0)) && aws_byte_buf_from_array_#res#1.allocator == 0) || ((((((((((((((((((((((((((((aws_byte_buf_from_array_#res#1.buffer == 0 && \result <= 1) && #memory_$Pointer$[buf][buf + 24] == 0) && bytes == 0) && 1 <= \result) && len == length) && #memory_$Pointer$[buf][buf + 24] == 0) && array == 0) && \result == 0) && buf == buf) && unknown-#memory_int-unknown[buf][16 + buf] == length) && !(buf == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && array == #memory_$Pointer$[buf][buf + 8]) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && #memory_$Pointer$[buf][buf + 8] == 0) && unknown-#memory_int-unknown[buf][buf] == length) && unknown-#res!capacity-unknown == length) && size == length) && array == bytes) && buf == 0) && aws_byte_buf_from_array_#res#1.allocator == 0) && buf == 0) && length == unknown-#res!len-unknown) && !(bytes == 0)) && array == aws_byte_buf_from_array_#res#1.buffer) && aws_byte_buf_from_array_#res#1.allocator == 0) && 18446744073709551616 * (len / 18446744073709551616) + 1 <= length) - InvariantResult [Line: 8978]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8203]: Loop Invariant [2021-11-23 12:31:42,888 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,888 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,889 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,889 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,889 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,890 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,890 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,890 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,892 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,892 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,898 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,898 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,898 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,899 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,900 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-23 12:31:42,900 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res#1 : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled Derived loop invariant: (((((((((((((((((aws_byte_buf_from_array_#res#1.buffer == 0 && 0 == aws_byte_buf_from_array_#res#1.buffer) && len == length) && length <= 18446744073709551616 * (length / 18446744073709551616)) && !(buf == 0)) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && unknown-#memory_int-unknown[buf][buf] <= 18446744073709551616 * (unknown-#memory_int-unknown[buf][buf] / 18446744073709551616)) && unknown-#res!capacity-unknown == length) && size == length) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16 + buf]) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= unknown-#memory_int-unknown[buf][buf]) && aws_byte_buf_from_array_#res#1.allocator == 0) && buf == 0) && length == unknown-#res!len-unknown) && !(bytes == 0)) && aws_byte_buf_from_array_#res#1.allocator == 0) || (((((((((((((((((((((aws_byte_buf_from_array_#res#1.buffer == 0 && bytes == 0) && len == length) && array == 0) && \result == 0) && !(buf == 0)) && !(\result == 0)) && len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967) && unknown-#res!capacity-unknown == length) && size == length) && array == bytes) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16 + buf]) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= unknown-#memory_int-unknown[buf][buf]) && aws_byte_buf_from_array_#res#1.allocator == 0) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616) + 18446744073709551615) && length == unknown-#res!len-unknown) && !(bytes == 0)) && array == aws_byte_buf_from_array_#res#1.buffer) && aws_byte_buf_from_array_#res#1.allocator == 0) && 18446744073709551616 * (len / 18446744073709551616) + 1 <= length) RESULT: Ultimate proved your program to be correct! [2021-11-23 12:31:42,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dacce6-7352-4e57-b8e7-526316686769/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE