./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh --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 Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a49fa15b0860d2357f9ad3c8c6bab1d80cf83a6734355dc0b05c55121c837273 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 04:44:00,757 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 04:44:00,758 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 04:44:00,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 04:44:00,771 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 04:44:00,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 04:44:00,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 04:44:00,773 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 04:44:00,774 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 04:44:00,775 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 04:44:00,775 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 04:44:00,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 04:44:00,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 04:44:00,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 04:44:00,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 04:44:00,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 04:44:00,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 04:44:00,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 04:44:00,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 04:44:00,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 04:44:00,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 04:44:00,783 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 04:44:00,784 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 04:44:00,785 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 04:44:00,787 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 04:44:00,787 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 04:44:00,787 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 04:44:00,788 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 04:44:00,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 04:44:00,789 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 04:44:00,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 04:44:00,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 04:44:00,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 04:44:00,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 04:44:00,791 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 04:44:00,791 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 04:44:00,792 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 04:44:00,792 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 04:44:00,792 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 04:44:00,793 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 04:44:00,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 04:44:00,794 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-64bit-Taipan_Default.epf [2022-12-14 04:44:00,807 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 04:44:00,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 04:44:00,808 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 04:44:00,808 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 04:44:00,808 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 04:44:00,809 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 04:44:00,809 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 04:44:00,809 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 04:44:00,809 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 04:44:00,809 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 04:44:00,809 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 04:44:00,815 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 04:44:00,815 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 04:44:00,815 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 04:44:00,816 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 04:44:00,816 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 04:44:00,816 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 04:44:00,816 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 04:44:00,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 04:44:00,817 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 04:44:00,817 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 04:44:00,818 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 04:44:00,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 04:44:00,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 04:44:00,818 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 04:44:00,818 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 04:44:00,819 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 04:44:00,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 04:44:00,819 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 04:44:00,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 04:44:00,819 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 04:44:00,819 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 04:44:00,820 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 04:44:00,820 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 04:44:00,820 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 04:44:00,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 04:44:00,820 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 04:44:00,820 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 04:44:00,820 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_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/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_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh 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 -> Taipan 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 -> a49fa15b0860d2357f9ad3c8c6bab1d80cf83a6734355dc0b05c55121c837273 [2022-12-14 04:44:00,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 04:44:01,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 04:44:01,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 04:44:01,007 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 04:44:01,007 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 04:44:01,009 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i [2022-12-14 04:44:03,573 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 04:44:03,850 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 04:44:03,851 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i [2022-12-14 04:44:03,868 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/data/b9a385080/0013aebf33da4b2088c236df35c243b3/FLAG6702d8dbc [2022-12-14 04:44:04,128 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/data/b9a385080/0013aebf33da4b2088c236df35c243b3 [2022-12-14 04:44:04,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 04:44:04,132 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 04:44:04,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 04:44:04,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 04:44:04,136 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 04:44:04,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:44:04" (1/1) ... [2022-12-14 04:44:04,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56bdfce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:44:04, skipping insertion in model container [2022-12-14 04:44:04,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:44:04" (1/1) ... [2022-12-14 04:44:04,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 04:44:04,196 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 04:44:04,356 WARN L237 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_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i[4493,4506] [2022-12-14 04:44:04,361 WARN L237 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_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i[4553,4566] [2022-12-14 04:44:04,951 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 04:44:04,956 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-14 04:44:04,956 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-14 04:44:04,957 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-14 04:44:04,957 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-14 04:44:04,958 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-14 04:44:04,968 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-14 04:44:04,969 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-14 04:44:04,970 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-14 04:44:04,970 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-14 04:44:04,972 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-14 04:44:04,973 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-14 04:44:04,973 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-14 04:44:04,974 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-14 04:44:05,024 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-14 04:44:05,024 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-14 04:44:05,025 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-14 04:44:05,029 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-12-14 04:44:05,030 WARN L623 FunctionHandler]: Unknown extern function htons [2022-12-14 04:44:05,031 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-12-14 04:44:05,219 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-12-14 04:44:05,220 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-12-14 04:44:05,220 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-12-14 04:44:05,221 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-12-14 04:44:05,222 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-12-14 04:44:05,223 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-12-14 04:44:05,224 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-12-14 04:44:05,224 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-12-14 04:44:05,225 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-12-14 04:44:05,225 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-12-14 04:44:05,226 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-12-14 04:44:05,330 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-12-14 04:44:05,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 04:44:05,358 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 04:44:05,368 WARN L237 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_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i[4493,4506] [2022-12-14 04:44:05,369 WARN L237 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_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i[4553,4566] [2022-12-14 04:44:05,396 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-14 04:44:05,399 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-14 04:44:05,399 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-14 04:44:05,399 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-14 04:44:05,400 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-14 04:44:05,400 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-14 04:44:05,406 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-14 04:44:05,406 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-14 04:44:05,407 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-14 04:44:05,408 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-14 04:44:05,408 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-14 04:44:05,409 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-14 04:44:05,409 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-14 04:44:05,410 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-14 04:44:05,415 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-14 04:44:05,415 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-14 04:44:05,416 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-14 04:44:05,418 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-12-14 04:44:05,419 WARN L623 FunctionHandler]: Unknown extern function htons [2022-12-14 04:44:05,419 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-12-14 04:44:05,434 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-12-14 04:44:05,434 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-12-14 04:44:05,435 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-12-14 04:44:05,435 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-12-14 04:44:05,436 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-12-14 04:44:05,436 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-12-14 04:44:05,437 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-12-14 04:44:05,437 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-12-14 04:44:05,437 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-12-14 04:44:05,438 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-12-14 04:44:05,438 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-12-14 04:44:05,453 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-12-14 04:44:05,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 04:44:05,575 INFO L208 MainTranslator]: Completed translation [2022-12-14 04:44:05,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:44:05 WrapperNode [2022-12-14 04:44:05,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 04:44:05,576 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 04:44:05,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 04:44:05,576 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 04:44:05,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:44:05" (1/1) ... [2022-12-14 04:44:05,629 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:44:05" (1/1) ... [2022-12-14 04:44:05,659 INFO L138 Inliner]: procedures = 679, calls = 1039, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 135 [2022-12-14 04:44:05,668 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 04:44:05,669 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 04:44:05,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 04:44:05,669 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 04:44:05,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:44:05" (1/1) ... [2022-12-14 04:44:05,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:44:05" (1/1) ... [2022-12-14 04:44:05,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:44:05" (1/1) ... [2022-12-14 04:44:05,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:44:05" (1/1) ... [2022-12-14 04:44:05,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:44:05" (1/1) ... [2022-12-14 04:44:05,696 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:44:05" (1/1) ... [2022-12-14 04:44:05,699 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:44:05" (1/1) ... [2022-12-14 04:44:05,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:44:05" (1/1) ... [2022-12-14 04:44:05,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 04:44:05,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 04:44:05,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 04:44:05,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 04:44:05,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:44:05" (1/1) ... [2022-12-14 04:44:05,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 04:44:05,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:44:05,734 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 04:44:05,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 04:44:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 04:44:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-14 04:44:05,768 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-14 04:44:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-12-14 04:44:05,768 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-12-14 04:44:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 04:44:05,769 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-12-14 04:44:05,769 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-12-14 04:44:05,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 04:44:05,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 04:44:05,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 04:44:05,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 04:44:05,769 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-14 04:44:05,769 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-14 04:44:05,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 04:44:05,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 04:44:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-14 04:44:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-12-14 04:44:05,770 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-12-14 04:44:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 04:44:05,953 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 04:44:05,955 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 04:44:06,125 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 04:44:06,206 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 04:44:06,206 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-14 04:44:06,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:44:06 BoogieIcfgContainer [2022-12-14 04:44:06,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 04:44:06,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 04:44:06,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 04:44:06,214 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 04:44:06,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 04:44:04" (1/3) ... [2022-12-14 04:44:06,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3043d085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:44:06, skipping insertion in model container [2022-12-14 04:44:06,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:44:05" (2/3) ... [2022-12-14 04:44:06,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3043d085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:44:06, skipping insertion in model container [2022-12-14 04:44:06,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:44:06" (3/3) ... [2022-12-14 04:44:06,217 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_end_harness.i [2022-12-14 04:44:06,235 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 04:44:06,235 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 04:44:06,277 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 04:44:06,282 INFO L357 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=FINITE_AUTOMATA, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6e421d46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 04:44:06,282 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 04:44:06,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-14 04:44:06,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 04:44:06,290 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:44:06,291 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:44:06,291 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:44:06,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:44:06,297 INFO L85 PathProgramCache]: Analyzing trace with hash -901301471, now seen corresponding path program 1 times [2022-12-14 04:44:06,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:44:06,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396598796] [2022-12-14 04:44:06,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:44:06,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:44:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:44:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 04:44:06,854 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:44:06,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396598796] [2022-12-14 04:44:06,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396598796] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:44:06,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847271047] [2022-12-14 04:44:06,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:44:06,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:44:06,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:44:06,857 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:44:06,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 04:44:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:44:06,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-14 04:44:07,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:44:07,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-12-14 04:44:07,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-12-14 04:44:07,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:07,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:07,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:07,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2022-12-14 04:44:07,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:07,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:07,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:07,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2022-12-14 04:44:08,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:08,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:08,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:44:08,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:08,969 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:44:08,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:08,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:08,971 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:44:08,978 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-12-14 04:44:08,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 8 disjoint index pairs (out of 66 index pairs), introduced 8 new quantified variables, introduced 32 case distinctions, treesize of input 132 treesize of output 78 [2022-12-14 04:44:08,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:08,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:08,991 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:44:08,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:08,992 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:44:08,993 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:44:08,997 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-12-14 04:44:08,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 4 disjoint index pairs (out of 36 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 73 treesize of output 31 [2022-12-14 04:44:09,001 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 04:44:09,002 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:44:09,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847271047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:44:09,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 04:44:09,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2022-12-14 04:44:09,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762064427] [2022-12-14 04:44:09,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:44:09,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 04:44:09,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:44:09,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 04:44:09,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-14 04:44:09,046 INFO L87 Difference]: Start difference. First operand has 45 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 04:44:09,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:44:09,743 INFO L93 Difference]: Finished difference Result 121 states and 170 transitions. [2022-12-14 04:44:09,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 04:44:09,745 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 37 [2022-12-14 04:44:09,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:44:09,750 INFO L225 Difference]: With dead ends: 121 [2022-12-14 04:44:09,751 INFO L226 Difference]: Without dead ends: 79 [2022-12-14 04:44:09,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-12-14 04:44:09,754 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 42 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 04:44:09,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 238 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 04:44:09,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-12-14 04:44:09,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2022-12-14 04:44:09,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 43 states have (on average 1.302325581395349) internal successors, (56), 45 states have internal predecessors, (56), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-12-14 04:44:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 102 transitions. [2022-12-14 04:44:09,789 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 102 transitions. Word has length 37 [2022-12-14 04:44:09,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:44:09,789 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 102 transitions. [2022-12-14 04:44:09,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 04:44:09,789 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 102 transitions. [2022-12-14 04:44:09,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 04:44:09,791 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:44:09,791 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:44:09,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 04:44:09,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-12-14 04:44:09,993 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:44:09,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:44:09,995 INFO L85 PathProgramCache]: Analyzing trace with hash 2094600787, now seen corresponding path program 1 times [2022-12-14 04:44:09,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:44:09,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48143252] [2022-12-14 04:44:09,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:44:09,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:44:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:44:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 04:44:10,258 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:44:10,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48143252] [2022-12-14 04:44:10,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48143252] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:44:10,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103518288] [2022-12-14 04:44:10,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:44:10,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:44:10,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:44:10,260 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:44:10,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 04:44:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:44:10,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 91 conjunts are in the unsatisfiable core [2022-12-14 04:44:10,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:44:10,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-12-14 04:44:10,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-12-14 04:44:10,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:10,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:10,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-12-14 04:44:10,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:10,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-12-14 04:44:10,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:10,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:10,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-12-14 04:44:10,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:10,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-12-14 04:44:10,628 INFO L321 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2022-12-14 04:44:10,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 141 [2022-12-14 04:44:10,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:10,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:10,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:10,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 125 [2022-12-14 04:44:10,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:10,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:10,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-12-14 04:44:10,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:10,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:10,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:10,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 44 [2022-12-14 04:44:10,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-12-14 04:44:10,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:10,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 21 [2022-12-14 04:44:10,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 04:44:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 04:44:12,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:44:15,517 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 8)) (.cse0 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse1 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 16))) (and (forall ((v_ArrVal_223 Int) (v_ArrVal_225 (Array Int Int)) (v_ArrVal_224 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_224) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse0 v_ArrVal_223)) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse1) 0)) (or (forall ((v_ArrVal_223 Int) (v_ArrVal_225 (Array Int Int)) (v_ArrVal_224 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_224) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse0 v_ArrVal_223)) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset|) 0))) (forall ((v_ArrVal_227 (Array Int Int)) (v_ArrVal_228 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_228) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset|) 0)))) (forall ((v_ArrVal_223 Int) (v_ArrVal_225 (Array Int Int)) (v_ArrVal_224 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_224) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse0 v_ArrVal_223)) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0)) (let ((.cse3 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 24))) (or (forall ((v_ArrVal_223 Int) (v_ArrVal_225 (Array Int Int)) (v_ArrVal_224 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_224) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse0 v_ArrVal_223)) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse3) 0))) (forall ((v_ArrVal_227 (Array Int Int)) (v_ArrVal_228 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_228) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse3) 0))))) (forall ((v_ArrVal_227 (Array Int Int)) (v_ArrVal_228 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_228) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_227 (Array Int Int)) (v_ArrVal_228 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_228) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse1) 0)) (or (not (= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| 0))))) is different from false [2022-12-14 04:44:15,618 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 16)) (.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| 0))) (.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 8))) (and (forall ((v_ArrVal_212 Int)) (or (not (< v_ArrVal_212 |c_#StackHeapBarrier|)) (= v_ArrVal_212 0) (forall ((v_ArrVal_227 (Array Int Int)) (v_ArrVal_228 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_212)))) (store (store .cse0 v_ArrVal_212 v_ArrVal_227) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store .cse0 v_ArrVal_212 v_ArrVal_228) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_212))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse3) 0)))) (forall ((v_ArrVal_212 Int)) (or (not (< v_ArrVal_212 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_223 Int) (v_ArrVal_225 (Array Int Int)) (v_ArrVal_224 (Array Int Int))) (= (select (select (store (store .cse4 v_ArrVal_212 v_ArrVal_224) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store .cse4 v_ArrVal_212 v_ArrVal_225) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_223)) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse3) 0)) (= v_ArrVal_212 0))) (forall ((v_ArrVal_212 Int)) (or (not (< v_ArrVal_212 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_223 Int) (v_ArrVal_225 (Array Int Int)) (v_ArrVal_224 (Array Int Int))) (= (select (select (store (store .cse4 v_ArrVal_212 v_ArrVal_224) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store .cse4 v_ArrVal_212 v_ArrVal_225) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_223)) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse5) 0)) (= v_ArrVal_212 0))) (forall ((v_ArrVal_212 Int)) (or (not (< v_ArrVal_212 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_227 (Array Int Int)) (v_ArrVal_228 (Array Int Int))) (not (= (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_212)))) (store (store .cse6 v_ArrVal_212 v_ArrVal_227) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store .cse6 v_ArrVal_212 v_ArrVal_228) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_212))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset|) 0))) (= v_ArrVal_212 0) (forall ((v_ArrVal_223 Int) (v_ArrVal_225 (Array Int Int)) (v_ArrVal_224 (Array Int Int))) (not (= (select (select (store (store .cse4 v_ArrVal_212 v_ArrVal_224) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store .cse4 v_ArrVal_212 v_ArrVal_225) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_223)) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset|) 0))))) (forall ((v_ArrVal_212 Int)) (let ((.cse7 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 24))) (or (not (< v_ArrVal_212 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_223 Int) (v_ArrVal_225 (Array Int Int)) (v_ArrVal_224 (Array Int Int))) (not (= (select (select (store (store .cse4 v_ArrVal_212 v_ArrVal_224) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store .cse4 v_ArrVal_212 v_ArrVal_225) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_223)) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse7) 0))) (= v_ArrVal_212 0) (forall ((v_ArrVal_227 (Array Int Int)) (v_ArrVal_228 (Array Int Int))) (not (= (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_212)))) (store (store .cse8 v_ArrVal_212 v_ArrVal_227) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store .cse8 v_ArrVal_212 v_ArrVal_228) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_212))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse7) 0)))))) (forall ((v_ArrVal_212 Int)) (or (not (< v_ArrVal_212 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_227 (Array Int Int)) (v_ArrVal_228 (Array Int Int))) (= (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_212)))) (store (store .cse9 v_ArrVal_212 v_ArrVal_227) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store .cse9 v_ArrVal_212 v_ArrVal_228) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_212))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse5) 0)) (= v_ArrVal_212 0))) (or (not (= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| 0))))) is different from false [2022-12-14 04:44:15,683 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:44:15,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 55 [2022-12-14 04:44:15,708 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:44:15,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 149 [2022-12-14 04:44:15,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 128 [2022-12-14 04:44:15,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 124 [2022-12-14 04:44:15,752 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:44:15,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 55 [2022-12-14 04:44:15,768 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:44:15,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 348 treesize of output 310 [2022-12-14 04:44:15,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 148 [2022-12-14 04:44:15,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 144 [2022-12-14 04:44:15,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-14 04:44:15,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-14 04:44:15,957 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:44:15,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 70 [2022-12-14 04:44:15,989 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:44:15,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 75 [2022-12-14 04:44:16,059 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:44:16,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 53 [2022-12-14 04:44:16,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2022-12-14 04:44:16,087 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:44:16,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 53 [2022-12-14 04:44:16,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 104 [2022-12-14 04:44:16,099 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:44:16,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-12-14 04:44:16,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:44:16,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:44:16,111 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:44:16,118 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 04:44:16,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 39 [2022-12-14 04:44:16,125 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:44:16,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:44:16,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:44:16,133 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:44:16,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 57 [2022-12-14 04:44:16,138 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:44:16,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-12-14 04:44:16,164 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:44:16,164 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:44:16,166 INFO L321 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-12-14 04:44:16,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 1 [2022-12-14 04:44:16,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:44:16,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:44:16,173 INFO L321 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-12-14 04:44:16,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 1 [2022-12-14 04:44:16,178 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:44:16,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:44:16,181 INFO L321 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-12-14 04:44:16,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 1 [2022-12-14 04:44:16,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:44:16,186 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:44:16,188 INFO L321 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-12-14 04:44:16,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 1 [2022-12-14 04:44:16,272 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 1 not checked. [2022-12-14 04:44:16,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103518288] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 04:44:16,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [233638604] [2022-12-14 04:44:16,285 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-12-14 04:44:16,286 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 04:44:16,288 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 04:44:16,292 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 04:44:16,292 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 04:44:16,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,365 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-12-14 04:44:16,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2022-12-14 04:44:16,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-12-14 04:44:16,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2022-12-14 04:44:16,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2022-12-14 04:44:16,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-12-14 04:44:16,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2022-12-14 04:44:16,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,762 INFO L321 Elim1Store]: treesize reduction 40, result has 48.1 percent of original size [2022-12-14 04:44:16,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 62 [2022-12-14 04:44:16,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,816 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:44:16,828 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 04:44:16,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 103 [2022-12-14 04:44:16,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 28 [2022-12-14 04:44:16,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:44:16,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,945 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-12-14 04:44:16,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 42 treesize of output 73 [2022-12-14 04:44:16,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:16,970 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:44:16,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 99 [2022-12-14 04:44:17,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 04:44:17,052 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:44:17,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:17,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 04:44:17,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:17,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2022-12-14 04:44:17,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:17,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 19 [2022-12-14 04:44:17,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:17,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 19 [2022-12-14 04:44:17,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 04:44:17,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:17,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 04:44:17,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:17,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:44:17,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:17,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:44:17,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:17,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:17,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2022-12-14 04:44:17,613 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 43 for LOIs [2022-12-14 04:44:17,765 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 136 for LOIs [2022-12-14 04:44:17,801 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-12-14 04:44:17,815 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 04:44:20,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [233638604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:44:20,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 04:44:20,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5, 10, 9] total 32 [2022-12-14 04:44:20,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277254802] [2022-12-14 04:44:20,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:44:20,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 04:44:20,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:44:20,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 04:44:20,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=777, Unknown=2, NotChecked=114, Total=992 [2022-12-14 04:44:20,060 INFO L87 Difference]: Start difference. First operand 77 states and 102 transitions. Second operand has 13 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 04:44:21,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:44:21,624 INFO L93 Difference]: Finished difference Result 138 states and 182 transitions. [2022-12-14 04:44:21,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 04:44:21,625 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 38 [2022-12-14 04:44:21,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:44:21,627 INFO L225 Difference]: With dead ends: 138 [2022-12-14 04:44:21,628 INFO L226 Difference]: Without dead ends: 103 [2022-12-14 04:44:21,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 77 SyntacticMatches, 10 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=120, Invalid=942, Unknown=2, NotChecked=126, Total=1190 [2022-12-14 04:44:21,629 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 16 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 04:44:21,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 205 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 04:44:21,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-12-14 04:44:21,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-12-14 04:44:21,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 66 states have internal predecessors, (85), 26 states have call successors, (26), 12 states have call predecessors, (26), 13 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-12-14 04:44:21,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 136 transitions. [2022-12-14 04:44:21,668 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 136 transitions. Word has length 38 [2022-12-14 04:44:21,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:44:21,668 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 136 transitions. [2022-12-14 04:44:21,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 04:44:21,669 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 136 transitions. [2022-12-14 04:44:21,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 04:44:21,670 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:44:21,670 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:44:21,675 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 04:44:21,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-12-14 04:44:21,871 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:44:21,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:44:21,871 INFO L85 PathProgramCache]: Analyzing trace with hash 537137871, now seen corresponding path program 1 times [2022-12-14 04:44:21,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:44:21,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991281267] [2022-12-14 04:44:21,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:44:21,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:44:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:44:22,030 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 04:44:22,030 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:44:22,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991281267] [2022-12-14 04:44:22,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991281267] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:44:22,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350149267] [2022-12-14 04:44:22,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:44:22,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:44:22,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:44:22,032 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:44:22,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 04:44:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:44:22,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 04:44:22,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:44:22,203 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 04:44:22,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:44:22,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350149267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:44:22,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 04:44:22,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-12-14 04:44:22,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041703683] [2022-12-14 04:44:22,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:44:22,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 04:44:22,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:44:22,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 04:44:22,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-14 04:44:22,205 INFO L87 Difference]: Start difference. First operand 103 states and 136 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 04:44:22,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:44:22,303 INFO L93 Difference]: Finished difference Result 207 states and 274 transitions. [2022-12-14 04:44:22,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 04:44:22,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 40 [2022-12-14 04:44:22,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:44:22,305 INFO L225 Difference]: With dead ends: 207 [2022-12-14 04:44:22,305 INFO L226 Difference]: Without dead ends: 111 [2022-12-14 04:44:22,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-12-14 04:44:22,306 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 31 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:44:22,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 144 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:44:22,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-12-14 04:44:22,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 103. [2022-12-14 04:44:22,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 66 states have internal predecessors, (83), 26 states have call successors, (26), 12 states have call predecessors, (26), 13 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-12-14 04:44:22,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 134 transitions. [2022-12-14 04:44:22,328 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 134 transitions. Word has length 40 [2022-12-14 04:44:22,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:44:22,328 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 134 transitions. [2022-12-14 04:44:22,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 04:44:22,329 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 134 transitions. [2022-12-14 04:44:22,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 04:44:22,331 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:44:22,331 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:44:22,336 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 04:44:22,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:44:22,532 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:44:22,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:44:22,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1649408245, now seen corresponding path program 1 times [2022-12-14 04:44:22,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:44:22,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926502238] [2022-12-14 04:44:22,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:44:22,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:44:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:44:22,742 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 04:44:22,742 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:44:22,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926502238] [2022-12-14 04:44:22,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926502238] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:44:22,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971651886] [2022-12-14 04:44:22,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:44:22,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:44:22,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:44:22,744 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:44:22,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 04:44:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:44:22,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 04:44:22,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:44:22,928 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 04:44:22,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:44:22,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971651886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:44:22,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 04:44:22,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2022-12-14 04:44:22,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513289758] [2022-12-14 04:44:22,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:44:22,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 04:44:22,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:44:22,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 04:44:22,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-12-14 04:44:22,930 INFO L87 Difference]: Start difference. First operand 103 states and 134 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 04:44:23,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:44:23,101 INFO L93 Difference]: Finished difference Result 249 states and 334 transitions. [2022-12-14 04:44:23,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 04:44:23,101 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 42 [2022-12-14 04:44:23,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:44:23,104 INFO L225 Difference]: With dead ends: 249 [2022-12-14 04:44:23,104 INFO L226 Difference]: Without dead ends: 151 [2022-12-14 04:44:23,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-12-14 04:44:23,105 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 61 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:44:23,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 167 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:44:23,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-12-14 04:44:23,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 105. [2022-12-14 04:44:23,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 68 states have internal predecessors, (85), 26 states have call successors, (26), 12 states have call predecessors, (26), 13 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-12-14 04:44:23,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 136 transitions. [2022-12-14 04:44:23,127 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 136 transitions. Word has length 42 [2022-12-14 04:44:23,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:44:23,128 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 136 transitions. [2022-12-14 04:44:23,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 04:44:23,128 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 136 transitions. [2022-12-14 04:44:23,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 04:44:23,129 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:44:23,129 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:44:23,135 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 04:44:23,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:44:23,330 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:44:23,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:44:23,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1709149374, now seen corresponding path program 1 times [2022-12-14 04:44:23,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:44:23,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736455732] [2022-12-14 04:44:23,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:44:23,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:44:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:44:23,592 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 04:44:23,592 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:44:23,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736455732] [2022-12-14 04:44:23,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736455732] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:44:23,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385091783] [2022-12-14 04:44:23,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:44:23,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:44:23,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:44:23,593 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:44:23,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 04:44:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:44:23,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 04:44:23,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:44:23,748 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 04:44:23,748 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:44:23,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385091783] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:44:23,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 04:44:23,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-14 04:44:23,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737952300] [2022-12-14 04:44:23,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:44:23,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:44:23,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:44:23,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:44:23,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-14 04:44:23,750 INFO L87 Difference]: Start difference. First operand 105 states and 136 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 04:44:23,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:44:23,819 INFO L93 Difference]: Finished difference Result 225 states and 309 transitions. [2022-12-14 04:44:23,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:44:23,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-12-14 04:44:23,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:44:23,821 INFO L225 Difference]: With dead ends: 225 [2022-12-14 04:44:23,821 INFO L226 Difference]: Without dead ends: 133 [2022-12-14 04:44:23,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-14 04:44:23,823 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 04:44:23,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 92 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 04:44:23,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-12-14 04:44:23,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 111. [2022-12-14 04:44:23,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 74 states have internal predecessors, (93), 26 states have call successors, (26), 12 states have call predecessors, (26), 13 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25) [2022-12-14 04:44:23,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 144 transitions. [2022-12-14 04:44:23,863 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 144 transitions. Word has length 43 [2022-12-14 04:44:23,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:44:23,864 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 144 transitions. [2022-12-14 04:44:23,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 04:44:23,864 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 144 transitions. [2022-12-14 04:44:23,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 04:44:23,866 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:44:23,866 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:44:23,871 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-14 04:44:24,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:44:24,068 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:44:24,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:44:24,069 INFO L85 PathProgramCache]: Analyzing trace with hash 452556718, now seen corresponding path program 1 times [2022-12-14 04:44:24,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:44:24,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019515019] [2022-12-14 04:44:24,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:44:24,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:44:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:44:24,266 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 04:44:24,267 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:44:24,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019515019] [2022-12-14 04:44:24,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019515019] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:44:24,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47053548] [2022-12-14 04:44:24,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:44:24,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:44:24,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:44:24,268 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:44:24,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 04:44:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:44:24,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 91 conjunts are in the unsatisfiable core [2022-12-14 04:44:24,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:44:24,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-14 04:44:24,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:24,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 04:44:24,565 INFO L321 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2022-12-14 04:44:24,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 115 [2022-12-14 04:44:24,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:24,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 91 [2022-12-14 04:44:24,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:44:24,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-12-14 04:44:24,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-12-14 04:44:24,654 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_33| Int) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse0 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_33|))) (let ((.cse1 (select .cse0 24))) (and (= (select .cse0 0) .cse1) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_33|) (= (select |c_#memory_$Pointer$.base| .cse1) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_10) .cse1 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_33| v_DerPreprocessor_10) .cse1)) (= (select v_DerPreprocessor_10 24) .cse1) (not (= .cse1 0)) (<= (+ 2 .cse1) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_33|))))) is different from true [2022-12-14 04:44:57,706 WARN L233 SmtUtils]: Spent 30.14s on a formula simplification that was a NOOP. DAG size: 91 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 04:45:05,306 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 6 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 04:45:05,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:45:08,626 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 04:45:08,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47053548] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 04:45:08,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1222882176] [2022-12-14 04:45:08,628 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-12-14 04:45:08,628 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 04:45:08,628 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 04:45:08,628 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 04:45:08,628 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 04:45:08,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:08,676 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-12-14 04:45:08,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2022-12-14 04:45:08,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:08,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-12-14 04:45:08,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:08,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-12-14 04:45:08,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2022-12-14 04:45:08,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:08,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:08,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:08,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:08,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:08,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2022-12-14 04:45:08,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:08,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:08,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:08,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:08,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:08,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2022-12-14 04:45:08,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:08,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:08,958 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-12-14 04:45:08,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 42 treesize of output 73 [2022-12-14 04:45:08,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:08,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:08,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:08,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:08,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:08,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:08,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:08,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:08,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 99 [2022-12-14 04:45:08,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:08,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:45:09,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:09,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:09,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:09,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:09,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:09,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:09,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:09,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:09,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:09,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 99 [2022-12-14 04:45:09,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:09,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:09,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 28 [2022-12-14 04:45:09,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:09,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:09,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2022-12-14 04:45:09,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:09,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:09,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:09,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:09,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:09,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:09,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:09,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:09,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:09,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:09,241 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:09,496 INFO L321 Elim1Store]: treesize reduction 227, result has 25.3 percent of original size [2022-12-14 04:45:09,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 11 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 662 treesize of output 671 [2022-12-14 04:45:09,550 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:09,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:09,553 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:09,553 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:09,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:09,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:09,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:09,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:09,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:09,777 INFO L321 Elim1Store]: treesize reduction 233, result has 26.3 percent of original size [2022-12-14 04:45:09,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 12 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 676 treesize of output 685 [2022-12-14 04:45:09,949 INFO L321 Elim1Store]: treesize reduction 152, result has 18.7 percent of original size [2022-12-14 04:45:09,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 643 treesize of output 654 [2022-12-14 04:45:10,152 INFO L321 Elim1Store]: treesize reduction 208, result has 17.1 percent of original size [2022-12-14 04:45:10,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 11 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 23 case distinctions, treesize of input 646 treesize of output 664 [2022-12-14 04:45:10,186 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:10,208 INFO L321 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2022-12-14 04:45:10,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 678 treesize of output 631 [2022-12-14 04:45:10,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:10,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:10,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 652 treesize of output 631 [2022-12-14 04:45:21,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:21,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 19 [2022-12-14 04:45:21,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 04:45:21,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 04:45:21,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:21,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 04:45:21,922 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:21,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:21,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 23 [2022-12-14 04:45:21,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:21,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 19 [2022-12-14 04:45:21,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:21,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 19 [2022-12-14 04:45:21,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:21,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:21,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2022-12-14 04:45:21,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:21,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:45:21,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:21,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 04:45:22,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:22,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:45:22,302 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 49 for LOIs [2022-12-14 04:45:22,618 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 155 for LOIs [2022-12-14 04:45:22,682 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-12-14 04:45:22,697 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 25 for LOIs [2022-12-14 04:45:22,755 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 04:45:28,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1222882176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:45:28,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 04:45:28,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [6, 23, 8] total 52 [2022-12-14 04:45:28,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980817756] [2022-12-14 04:45:28,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:45:28,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 04:45:28,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:45:28,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 04:45:28,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2227, Unknown=149, NotChecked=98, Total=2652 [2022-12-14 04:45:28,322 INFO L87 Difference]: Start difference. First operand 111 states and 144 transitions. Second operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 13 states have internal predecessors, (22), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-12-14 04:45:31,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:45:31,374 INFO L93 Difference]: Finished difference Result 227 states and 291 transitions. [2022-12-14 04:45:31,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 04:45:31,375 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 1.375) internal successors, (22), 13 states have internal predecessors, (22), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 46 [2022-12-14 04:45:31,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:45:31,375 INFO L225 Difference]: With dead ends: 227 [2022-12-14 04:45:31,375 INFO L226 Difference]: Without dead ends: 125 [2022-12-14 04:45:31,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 45.0s TimeCoverageRelationStatistics Valid=230, Invalid=2808, Unknown=158, NotChecked=110, Total=3306 [2022-12-14 04:45:31,377 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 33 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 04:45:31,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 204 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 04:45:31,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-12-14 04:45:31,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2022-12-14 04:45:31,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 82 states have internal predecessors, (102), 28 states have call successors, (28), 14 states have call predecessors, (28), 16 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2022-12-14 04:45:31,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 158 transitions. [2022-12-14 04:45:31,403 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 158 transitions. Word has length 46 [2022-12-14 04:45:31,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:45:31,403 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 158 transitions. [2022-12-14 04:45:31,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 1.375) internal successors, (22), 13 states have internal predecessors, (22), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-12-14 04:45:31,404 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 158 transitions. [2022-12-14 04:45:31,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-14 04:45:31,404 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:45:31,405 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:45:31,410 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 04:45:31,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-14 04:45:31,606 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:45:31,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:45:31,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1971298836, now seen corresponding path program 1 times [2022-12-14 04:45:31,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:45:31,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323573364] [2022-12-14 04:45:31,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:45:31,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:45:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:45:32,109 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 04:45:32,109 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:45:32,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323573364] [2022-12-14 04:45:32,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323573364] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:45:32,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759217087] [2022-12-14 04:45:32,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:45:32,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:45:32,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:45:32,110 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:45:32,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 04:45:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:45:32,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-14 04:45:32,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:45:36,170 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 04:45:36,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:45:36,330 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 04:45:36,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759217087] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 04:45:36,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1602956942] [2022-12-14 04:45:36,333 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-12-14 04:45:36,333 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 04:45:36,333 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 04:45:36,333 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 04:45:36,333 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 04:45:36,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,375 INFO L321 Elim1Store]: treesize reduction 30, result has 48.3 percent of original size [2022-12-14 04:45:36,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 50 [2022-12-14 04:45:36,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,414 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-12-14 04:45:36,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2022-12-14 04:45:36,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2022-12-14 04:45:36,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2022-12-14 04:45:36,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2022-12-14 04:45:36,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-12-14 04:45:36,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,685 INFO L321 Elim1Store]: treesize reduction 40, result has 48.1 percent of original size [2022-12-14 04:45:36,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 62 [2022-12-14 04:45:36,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,740 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-12-14 04:45:36,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 42 treesize of output 73 [2022-12-14 04:45:36,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 99 [2022-12-14 04:45:36,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 28 [2022-12-14 04:45:36,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,817 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:36,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 99 [2022-12-14 04:45:36,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:36,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:45:37,015 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:37,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:37,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:37,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:37,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:37,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:37,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:37,023 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:37,024 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:37,308 INFO L321 Elim1Store]: treesize reduction 227, result has 25.3 percent of original size [2022-12-14 04:45:37,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 12 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 666 treesize of output 675 [2022-12-14 04:45:37,355 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:37,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:37,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:37,360 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:37,361 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:37,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:37,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:37,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:37,365 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:37,375 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:37,598 INFO L321 Elim1Store]: treesize reduction 251, result has 26.2 percent of original size [2022-12-14 04:45:37,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 12 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 692 treesize of output 695 [2022-12-14 04:45:37,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:37,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 19 [2022-12-14 04:45:37,641 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:37,666 INFO L321 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2022-12-14 04:45:37,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 686 treesize of output 639 [2022-12-14 04:45:37,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:37,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:37,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 660 treesize of output 639 [2022-12-14 04:45:37,864 INFO L321 Elim1Store]: treesize reduction 196, result has 21.9 percent of original size [2022-12-14 04:45:37,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 11 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 23 case distinctions, treesize of input 652 treesize of output 682 [2022-12-14 04:45:37,949 INFO L321 Elim1Store]: treesize reduction 110, result has 15.4 percent of original size [2022-12-14 04:45:37,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 645 treesize of output 656 [2022-12-14 04:45:38,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 04:45:38,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:38,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 04:45:38,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:38,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:38,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 23 [2022-12-14 04:45:38,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:38,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 19 [2022-12-14 04:45:38,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:38,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 19 [2022-12-14 04:45:38,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 04:45:38,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:38,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:45:38,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:38,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:38,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2022-12-14 04:45:38,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:38,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 04:45:38,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:38,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:45:39,249 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 44 for LOIs [2022-12-14 04:45:39,740 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 156 for LOIs [2022-12-14 04:45:39,771 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-12-14 04:45:39,784 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 20 for LOIs [2022-12-14 04:45:39,823 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 04:45:46,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1602956942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:45:46,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 04:45:46,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [8, 8, 6] total 37 [2022-12-14 04:45:46,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176585095] [2022-12-14 04:45:46,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:45:46,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 04:45:46,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:45:46,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 04:45:46,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1190, Unknown=0, NotChecked=0, Total=1332 [2022-12-14 04:45:46,719 INFO L87 Difference]: Start difference. First operand 123 states and 158 transitions. Second operand has 21 states, 16 states have (on average 1.5) internal successors, (24), 14 states have internal predecessors, (24), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-12-14 04:45:49,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:45:49,962 INFO L93 Difference]: Finished difference Result 253 states and 321 transitions. [2022-12-14 04:45:49,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 04:45:49,963 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 16 states have (on average 1.5) internal successors, (24), 14 states have internal predecessors, (24), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 48 [2022-12-14 04:45:49,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:45:49,964 INFO L225 Difference]: With dead ends: 253 [2022-12-14 04:45:49,964 INFO L226 Difference]: Without dead ends: 139 [2022-12-14 04:45:49,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=259, Invalid=1811, Unknown=0, NotChecked=0, Total=2070 [2022-12-14 04:45:49,966 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 80 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:45:49,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 182 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 04:45:49,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-12-14 04:45:50,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 125. [2022-12-14 04:45:50,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 80 states have (on average 1.3) internal successors, (104), 84 states have internal predecessors, (104), 28 states have call successors, (28), 14 states have call predecessors, (28), 16 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2022-12-14 04:45:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 160 transitions. [2022-12-14 04:45:50,009 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 160 transitions. Word has length 48 [2022-12-14 04:45:50,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:45:50,010 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 160 transitions. [2022-12-14 04:45:50,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 16 states have (on average 1.5) internal successors, (24), 14 states have internal predecessors, (24), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-12-14 04:45:50,010 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 160 transitions. [2022-12-14 04:45:50,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-14 04:45:50,010 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:45:50,011 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:45:50,017 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 04:45:50,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-14 04:45:50,212 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:45:50,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:45:50,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1197144193, now seen corresponding path program 1 times [2022-12-14 04:45:50,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:45:50,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512133064] [2022-12-14 04:45:50,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:45:50,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:45:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:45:50,346 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 04:45:50,346 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:45:50,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512133064] [2022-12-14 04:45:50,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512133064] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:45:50,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805312918] [2022-12-14 04:45:50,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:45:50,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:45:50,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:45:50,348 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:45:50,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 04:45:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:45:50,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-14 04:45:50,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:45:50,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-14 04:45:50,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:50,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 04:45:50,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:50,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:50,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2022-12-14 04:45:50,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:50,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-12-14 04:45:50,822 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 04:45:50,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:45:51,058 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:45:51,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2022-12-14 04:45:51,070 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:45:51,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 149 [2022-12-14 04:45:51,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 144 [2022-12-14 04:45:51,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 142 [2022-12-14 04:45:51,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-14 04:45:51,138 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:45:51,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-12-14 04:45:51,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2022-12-14 04:45:51,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2022-12-14 04:45:51,161 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:45:51,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 72 [2022-12-14 04:45:51,314 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 04:45:51,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805312918] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 04:45:51,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1666548126] [2022-12-14 04:45:51,316 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-12-14 04:45:51,316 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 04:45:51,316 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 04:45:51,316 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 04:45:51,317 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 04:45:51,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,354 INFO L321 Elim1Store]: treesize reduction 30, result has 48.3 percent of original size [2022-12-14 04:45:51,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 50 [2022-12-14 04:45:51,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,397 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-12-14 04:45:51,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2022-12-14 04:45:51,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2022-12-14 04:45:51,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2022-12-14 04:45:51,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2022-12-14 04:45:51,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-12-14 04:45:51,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,632 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:51,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:51,648 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 04:45:51,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 103 [2022-12-14 04:45:51,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,714 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-12-14 04:45:51,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 42 treesize of output 73 [2022-12-14 04:45:51,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:45:51,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 28 [2022-12-14 04:45:51,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2022-12-14 04:45:51,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 99 [2022-12-14 04:45:51,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 04:45:51,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:45:51,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 23 [2022-12-14 04:45:51,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 19 [2022-12-14 04:45:51,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 19 [2022-12-14 04:45:51,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 04:45:51,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 04:45:51,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2022-12-14 04:45:51,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:45:51,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:45:51,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:45:51,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 04:45:53,650 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 44 for LOIs [2022-12-14 04:45:53,665 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 19 for LOIs [2022-12-14 04:45:54,256 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 15 for LOIs [2022-12-14 04:45:54,258 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-12-14 04:45:54,272 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 20 for LOIs [2022-12-14 04:45:54,320 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 04:45:59,509 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5024#(and (<= 0 |__VERIFIER_assert_#in~cond|) (= |~#s_can_fail_allocator_static~0.base| 4) (= (mod __VERIFIER_assert_~cond 256) 0) (= |~#s_can_fail_allocator_static~0.offset| 0) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_63| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_63| Int)) (and (<= 0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_63|) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_63| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_63|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_63| 24))) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_63|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_63| 24)))) (<= 0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_63|) (= (+ 16 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_63|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_63|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_63| 24))) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_63|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_63| 24)))) (<= 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_63|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_63| 24))) (<= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_63|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_63| 24)) 0) (<= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_63| 0))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= ~tl_last_error~0 0) (= |#NULL.offset| 0) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 04:45:59,510 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 04:45:59,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 04:45:59,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 11] total 24 [2022-12-14 04:45:59,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724325530] [2022-12-14 04:45:59,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 04:45:59,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 04:45:59,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:45:59,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 04:45:59,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2340, Unknown=9, NotChecked=0, Total=2550 [2022-12-14 04:45:59,513 INFO L87 Difference]: Start difference. First operand 125 states and 160 transitions. Second operand has 24 states, 20 states have (on average 3.25) internal successors, (65), 23 states have internal predecessors, (65), 9 states have call successors, (24), 3 states have call predecessors, (24), 7 states have return successors, (23), 7 states have call predecessors, (23), 9 states have call successors, (23) [2022-12-14 04:46:00,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:46:00,718 INFO L93 Difference]: Finished difference Result 261 states and 343 transitions. [2022-12-14 04:46:00,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 04:46:00,718 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 3.25) internal successors, (65), 23 states have internal predecessors, (65), 9 states have call successors, (24), 3 states have call predecessors, (24), 7 states have return successors, (23), 7 states have call predecessors, (23), 9 states have call successors, (23) Word has length 49 [2022-12-14 04:46:00,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:46:00,720 INFO L225 Difference]: With dead ends: 261 [2022-12-14 04:46:00,721 INFO L226 Difference]: Without dead ends: 199 [2022-12-14 04:46:00,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 105 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=307, Invalid=3465, Unknown=10, NotChecked=0, Total=3782 [2022-12-14 04:46:00,724 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 184 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 04:46:00,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 528 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 04:46:00,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-12-14 04:46:00,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 129. [2022-12-14 04:46:00,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 88 states have internal predecessors, (108), 28 states have call successors, (28), 14 states have call predecessors, (28), 17 states have return successors, (29), 26 states have call predecessors, (29), 26 states have call successors, (29) [2022-12-14 04:46:00,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 165 transitions. [2022-12-14 04:46:00,767 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 165 transitions. Word has length 49 [2022-12-14 04:46:00,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:46:00,768 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 165 transitions. [2022-12-14 04:46:00,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 3.25) internal successors, (65), 23 states have internal predecessors, (65), 9 states have call successors, (24), 3 states have call predecessors, (24), 7 states have return successors, (23), 7 states have call predecessors, (23), 9 states have call successors, (23) [2022-12-14 04:46:00,768 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 165 transitions. [2022-12-14 04:46:00,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-14 04:46:00,768 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:46:00,768 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:46:00,775 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 04:46:00,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:46:00,970 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:46:00,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:46:00,971 INFO L85 PathProgramCache]: Analyzing trace with hash -150880783, now seen corresponding path program 1 times [2022-12-14 04:46:00,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:46:00,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860644469] [2022-12-14 04:46:00,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:46:00,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:46:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:46:01,265 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 04:46:01,265 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:46:01,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860644469] [2022-12-14 04:46:01,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860644469] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:46:01,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849207839] [2022-12-14 04:46:01,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:46:01,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:46:01,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:46:01,266 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:46:01,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 04:46:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:46:01,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 04:46:01,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:46:01,434 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 04:46:01,434 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:46:01,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849207839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:46:01,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 04:46:01,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-12-14 04:46:01,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803212908] [2022-12-14 04:46:01,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:46:01,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 04:46:01,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:46:01,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 04:46:01,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-12-14 04:46:01,436 INFO L87 Difference]: Start difference. First operand 129 states and 165 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-14 04:46:01,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:46:01,576 INFO L93 Difference]: Finished difference Result 247 states and 313 transitions. [2022-12-14 04:46:01,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 04:46:01,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 52 [2022-12-14 04:46:01,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:46:01,578 INFO L225 Difference]: With dead ends: 247 [2022-12-14 04:46:01,578 INFO L226 Difference]: Without dead ends: 131 [2022-12-14 04:46:01,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-12-14 04:46:01,579 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 32 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:46:01,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 166 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:46:01,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-12-14 04:46:01,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2022-12-14 04:46:01,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 88 states have internal predecessors, (106), 28 states have call successors, (28), 14 states have call predecessors, (28), 17 states have return successors, (29), 26 states have call predecessors, (29), 26 states have call successors, (29) [2022-12-14 04:46:01,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 163 transitions. [2022-12-14 04:46:01,614 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 163 transitions. Word has length 52 [2022-12-14 04:46:01,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:46:01,614 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 163 transitions. [2022-12-14 04:46:01,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-14 04:46:01,614 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 163 transitions. [2022-12-14 04:46:01,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-14 04:46:01,615 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:46:01,615 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:46:01,620 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 04:46:01,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:46:01,816 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:46:01,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:46:01,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2078798571, now seen corresponding path program 1 times [2022-12-14 04:46:01,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:46:01,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924377449] [2022-12-14 04:46:01,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:46:01,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:46:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:46:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 04:46:02,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:46:02,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924377449] [2022-12-14 04:46:02,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924377449] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:46:02,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534418700] [2022-12-14 04:46:02,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:46:02,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:46:02,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:46:02,146 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:46:02,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 04:46:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:46:02,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 04:46:02,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:46:02,362 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 04:46:02,362 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:46:02,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534418700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:46:02,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 04:46:02,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2022-12-14 04:46:02,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930975853] [2022-12-14 04:46:02,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:46:02,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 04:46:02,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:46:02,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 04:46:02,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-12-14 04:46:02,363 INFO L87 Difference]: Start difference. First operand 129 states and 163 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-14 04:46:02,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:46:02,541 INFO L93 Difference]: Finished difference Result 273 states and 343 transitions. [2022-12-14 04:46:02,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 04:46:02,541 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 56 [2022-12-14 04:46:02,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:46:02,542 INFO L225 Difference]: With dead ends: 273 [2022-12-14 04:46:02,542 INFO L226 Difference]: Without dead ends: 155 [2022-12-14 04:46:02,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2022-12-14 04:46:02,543 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 47 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:46:02,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 190 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:46:02,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-12-14 04:46:02,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 129. [2022-12-14 04:46:02,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 88 states have internal predecessors, (104), 28 states have call successors, (28), 14 states have call predecessors, (28), 17 states have return successors, (29), 26 states have call predecessors, (29), 26 states have call successors, (29) [2022-12-14 04:46:02,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 161 transitions. [2022-12-14 04:46:02,577 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 161 transitions. Word has length 56 [2022-12-14 04:46:02,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:46:02,578 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 161 transitions. [2022-12-14 04:46:02,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-14 04:46:02,578 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 161 transitions. [2022-12-14 04:46:02,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 04:46:02,578 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:46:02,578 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:46:02,583 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 04:46:02,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 04:46:02,780 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:46:02,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:46:02,784 INFO L85 PathProgramCache]: Analyzing trace with hash 48483986, now seen corresponding path program 1 times [2022-12-14 04:46:02,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:46:02,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756873146] [2022-12-14 04:46:02,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:46:02,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:46:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:46:03,007 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 04:46:03,007 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:46:03,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756873146] [2022-12-14 04:46:03,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756873146] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:46:03,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389339103] [2022-12-14 04:46:03,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:46:03,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:46:03,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:46:03,009 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:46:03,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 04:46:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:46:03,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 95 conjunts are in the unsatisfiable core [2022-12-14 04:46:03,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:46:03,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-14 04:46:03,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:03,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 04:46:03,346 INFO L321 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2022-12-14 04:46:03,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 104 [2022-12-14 04:46:03,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:03,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 82 [2022-12-14 04:46:03,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-12-14 04:46:03,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:03,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 21 [2022-12-14 04:46:03,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 04:46:16,515 WARN L233 SmtUtils]: Spent 10.88s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 04:46:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 04:46:20,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:46:22,873 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-14 04:46:22,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389339103] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 04:46:22,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1318648874] [2022-12-14 04:46:22,875 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-12-14 04:46:22,875 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 04:46:22,876 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 04:46:22,876 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 04:46:22,876 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 04:46:22,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:22,919 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-12-14 04:46:22,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2022-12-14 04:46:22,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:22,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-12-14 04:46:23,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2022-12-14 04:46:23,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2022-12-14 04:46:23,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-12-14 04:46:23,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2022-12-14 04:46:23,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:46:23,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:46:23,197 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 04:46:23,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 103 [2022-12-14 04:46:23,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:46:23,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,233 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:46:23,243 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 04:46:23,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 103 [2022-12-14 04:46:23,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 28 [2022-12-14 04:46:23,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,317 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-12-14 04:46:23,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 42 treesize of output 73 [2022-12-14 04:46:23,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2022-12-14 04:46:23,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 04:46:23,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 04:46:23,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 13 [2022-12-14 04:46:23,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 13 [2022-12-14 04:46:23,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:46:23,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 23 [2022-12-14 04:46:23,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 04:46:23,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 04:46:23,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:46:23,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2022-12-14 04:46:23,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:23,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:46:24,151 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 44 for LOIs [2022-12-14 04:46:24,681 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 156 for LOIs [2022-12-14 04:46:24,717 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-12-14 04:46:24,732 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 20 for LOIs [2022-12-14 04:46:24,780 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 04:46:30,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1318648874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:46:30,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 04:46:30,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [6, 18, 7] total 46 [2022-12-14 04:46:30,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458883366] [2022-12-14 04:46:30,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:46:30,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 04:46:30,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:46:30,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 04:46:30,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1897, Unknown=0, NotChecked=0, Total=2070 [2022-12-14 04:46:30,309 INFO L87 Difference]: Start difference. First operand 129 states and 161 transitions. Second operand has 20 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 13 states have internal predecessors, (23), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-12-14 04:46:33,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:46:33,764 INFO L93 Difference]: Finished difference Result 257 states and 317 transitions. [2022-12-14 04:46:33,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 04:46:33,765 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 13 states have internal predecessors, (23), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 60 [2022-12-14 04:46:33,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:46:33,765 INFO L225 Difference]: With dead ends: 257 [2022-12-14 04:46:33,766 INFO L226 Difference]: Without dead ends: 137 [2022-12-14 04:46:33,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 131 SyntacticMatches, 9 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=257, Invalid=2605, Unknown=0, NotChecked=0, Total=2862 [2022-12-14 04:46:33,767 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 59 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:46:33,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 147 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 04:46:33,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-12-14 04:46:33,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2022-12-14 04:46:33,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 88 states have internal predecessors, (102), 28 states have call successors, (28), 14 states have call predecessors, (28), 17 states have return successors, (29), 25 states have call predecessors, (29), 26 states have call successors, (29) [2022-12-14 04:46:33,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 159 transitions. [2022-12-14 04:46:33,802 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 159 transitions. Word has length 60 [2022-12-14 04:46:33,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:46:33,802 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 159 transitions. [2022-12-14 04:46:33,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 13 states have internal predecessors, (23), 5 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-12-14 04:46:33,802 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 159 transitions. [2022-12-14 04:46:33,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-14 04:46:33,802 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:46:33,803 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:46:33,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 04:46:34,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-14 04:46:34,003 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:46:34,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:46:34,003 INFO L85 PathProgramCache]: Analyzing trace with hash -894820411, now seen corresponding path program 1 times [2022-12-14 04:46:34,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:46:34,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132938847] [2022-12-14 04:46:34,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:46:34,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:46:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:46:34,123 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 04:46:34,123 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:46:34,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132938847] [2022-12-14 04:46:34,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132938847] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:46:34,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711866034] [2022-12-14 04:46:34,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:46:34,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:46:34,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:46:34,125 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:46:34,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 04:46:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:46:34,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-14 04:46:34,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:46:34,396 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-14 04:46:34,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:46:34,522 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 04:46:34,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711866034] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 04:46:34,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [738245004] [2022-12-14 04:46:34,524 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-12-14 04:46:34,524 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 04:46:34,525 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 04:46:34,525 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 04:46:34,525 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 04:46:34,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,576 INFO L321 Elim1Store]: treesize reduction 30, result has 48.3 percent of original size [2022-12-14 04:46:34,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 50 [2022-12-14 04:46:34,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,626 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-12-14 04:46:34,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2022-12-14 04:46:34,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2022-12-14 04:46:34,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2022-12-14 04:46:34,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-12-14 04:46:34,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2022-12-14 04:46:34,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,918 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:46:34,932 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 04:46:34,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 103 [2022-12-14 04:46:34,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,961 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:46:34,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:34,965 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:46:34,980 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 04:46:34,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 103 [2022-12-14 04:46:35,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:35,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:35,062 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-12-14 04:46:35,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 42 treesize of output 73 [2022-12-14 04:46:35,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:35,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:35,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 28 [2022-12-14 04:46:35,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:35,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:46:35,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:35,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:35,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2022-12-14 04:46:35,193 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:46:35,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:35,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 04:46:35,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:35,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2022-12-14 04:46:35,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:35,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2022-12-14 04:46:35,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:35,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2022-12-14 04:46:35,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 04:46:35,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 04:46:35,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:35,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:46:35,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:35,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:35,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2022-12-14 04:46:35,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:35,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 04:46:35,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:35,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:46:37,304 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 44 for LOIs [2022-12-14 04:46:37,317 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 19 for LOIs [2022-12-14 04:46:38,042 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 15 for LOIs [2022-12-14 04:46:38,043 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-12-14 04:46:38,055 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 20 for LOIs [2022-12-14 04:46:38,106 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 04:46:43,116 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8513#(and (<= 0 |__VERIFIER_assert_#in~cond|) (= |~#s_can_fail_allocator_static~0.base| 4) (= (mod __VERIFIER_assert_~cond 256) 0) (= |~#s_can_fail_allocator_static~0.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= ~tl_last_error~0 0) (= |#NULL.offset| 0) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_99| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_99| Int)) (and (<= 0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_99|) (<= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_99| 0) (= (+ 16 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_99|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_99|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_99| 24))) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_99|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_99| 24)))) (<= 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_99|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_99| 24))) (<= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_99|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_99| 24)) 0) (<= 0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_99|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_99|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_99| 24))) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_99|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_99| 24))) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_99|))) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 04:46:43,116 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 04:46:43,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 04:46:43,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 6] total 16 [2022-12-14 04:46:43,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684110210] [2022-12-14 04:46:43,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 04:46:43,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 04:46:43,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:46:43,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 04:46:43,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1649, Unknown=0, NotChecked=0, Total=1806 [2022-12-14 04:46:43,117 INFO L87 Difference]: Start difference. First operand 128 states and 159 transitions. Second operand has 16 states, 10 states have (on average 4.1) internal successors, (41), 12 states have internal predecessors, (41), 5 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-12-14 04:46:43,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:46:43,337 INFO L93 Difference]: Finished difference Result 257 states and 317 transitions. [2022-12-14 04:46:43,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 04:46:43,338 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 10 states have (on average 4.1) internal successors, (41), 12 states have internal predecessors, (41), 5 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 63 [2022-12-14 04:46:43,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:46:43,338 INFO L225 Difference]: With dead ends: 257 [2022-12-14 04:46:43,339 INFO L226 Difference]: Without dead ends: 152 [2022-12-14 04:46:43,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 147 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=173, Invalid=1897, Unknown=0, NotChecked=0, Total=2070 [2022-12-14 04:46:43,339 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 7 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:46:43,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 583 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:46:43,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-12-14 04:46:43,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 132. [2022-12-14 04:46:43,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 92 states have internal predecessors, (105), 28 states have call successors, (28), 14 states have call predecessors, (28), 18 states have return successors, (30), 25 states have call predecessors, (30), 26 states have call successors, (30) [2022-12-14 04:46:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 163 transitions. [2022-12-14 04:46:43,374 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 163 transitions. Word has length 63 [2022-12-14 04:46:43,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:46:43,375 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 163 transitions. [2022-12-14 04:46:43,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 10 states have (on average 4.1) internal successors, (41), 12 states have internal predecessors, (41), 5 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-12-14 04:46:43,375 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 163 transitions. [2022-12-14 04:46:43,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-14 04:46:43,375 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:46:43,375 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:46:43,381 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 04:46:43,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:46:43,577 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:46:43,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:46:43,578 INFO L85 PathProgramCache]: Analyzing trace with hash 292884767, now seen corresponding path program 1 times [2022-12-14 04:46:43,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:46:43,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29734081] [2022-12-14 04:46:43,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:46:43,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:46:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:46:43,786 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 04:46:43,786 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:46:43,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29734081] [2022-12-14 04:46:43,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29734081] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:46:43,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360645024] [2022-12-14 04:46:43,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:46:43,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:46:43,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:46:43,787 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:46:43,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 04:46:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:46:43,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-14 04:46:43,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:46:46,048 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_41| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_41| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_41|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_41|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_41| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_41| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_41|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_41|) 0)))) is different from true [2022-12-14 04:46:46,586 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 04:46:46,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 30 [2022-12-14 04:46:46,590 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-14 04:46:46,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 1 [2022-12-14 04:46:46,592 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 26 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-12-14 04:46:46,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:46:47,048 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-14 04:46:47,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-12-14 04:46:47,056 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-14 04:46:47,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2022-12-14 04:46:47,076 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 04:46:47,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360645024] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 04:46:47,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [566569201] [2022-12-14 04:46:47,078 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-12-14 04:46:47,078 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 04:46:47,078 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 04:46:47,078 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 04:46:47,078 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 04:46:47,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,127 INFO L321 Elim1Store]: treesize reduction 30, result has 48.3 percent of original size [2022-12-14 04:46:47,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 50 [2022-12-14 04:46:47,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,174 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-12-14 04:46:47,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2022-12-14 04:46:47,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2022-12-14 04:46:47,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2022-12-14 04:46:47,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-12-14 04:46:47,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2022-12-14 04:46:47,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,443 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:46:47,455 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 04:46:47,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 103 [2022-12-14 04:46:47,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,511 INFO L321 Elim1Store]: treesize reduction 40, result has 48.1 percent of original size [2022-12-14 04:46:47,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 62 [2022-12-14 04:46:47,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:46:47,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 28 [2022-12-14 04:46:47,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,590 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-12-14 04:46:47,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 42 treesize of output 73 [2022-12-14 04:46:47,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,611 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:46:47,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 99 [2022-12-14 04:46:47,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 04:46:47,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 04:46:47,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 04:46:47,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 13 [2022-12-14 04:46:47,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 13 [2022-12-14 04:46:47,721 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:46:47,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 23 [2022-12-14 04:46:47,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2022-12-14 04:46:47,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:46:47,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:46:47,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:46:47,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 04:46:49,650 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 44 for LOIs [2022-12-14 04:46:49,671 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 19 for LOIs [2022-12-14 04:46:50,258 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 15 for LOIs [2022-12-14 04:46:50,259 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-12-14 04:46:50,272 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 20 for LOIs [2022-12-14 04:46:50,332 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 04:46:56,178 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9528#(and (<= 0 |__VERIFIER_assert_#in~cond|) (= |~#s_can_fail_allocator_static~0.base| 4) (= (mod __VERIFIER_assert_~cond 256) 0) (= |~#s_can_fail_allocator_static~0.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= ~tl_last_error~0 0) (= |#NULL.offset| 0) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_121| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_121| Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_121|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_121| 24))) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_121|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_121| 24))) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_121|) (<= 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_121|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_121| 24))) (<= 0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_121|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_121|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_121| 24))) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_121|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_121| 24))) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_121| 16)) (<= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_121| 0) (<= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_121|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_121| 24)) 0) (<= 0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_121|))) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 04:46:56,179 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 04:46:56,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 04:46:56,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17, 14] total 30 [2022-12-14 04:46:56,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847957396] [2022-12-14 04:46:56,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 04:46:56,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-14 04:46:56,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:46:56,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-14 04:46:56,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=2833, Unknown=1, NotChecked=108, Total=3192 [2022-12-14 04:46:56,183 INFO L87 Difference]: Start difference. First operand 132 states and 163 transitions. Second operand has 30 states, 26 states have (on average 3.1923076923076925) internal successors, (83), 27 states have internal predecessors, (83), 13 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (25), 11 states have call predecessors, (25), 13 states have call successors, (25) [2022-12-14 04:46:58,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:47:00,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:47:02,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:47:04,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:47:04,303 INFO L93 Difference]: Finished difference Result 392 states and 482 transitions. [2022-12-14 04:47:04,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-14 04:47:04,304 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 3.1923076923076925) internal successors, (83), 27 states have internal predecessors, (83), 13 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (25), 11 states have call predecessors, (25), 13 states have call successors, (25) Word has length 65 [2022-12-14 04:47:04,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:47:04,305 INFO L225 Difference]: With dead ends: 392 [2022-12-14 04:47:04,305 INFO L226 Difference]: Without dead ends: 253 [2022-12-14 04:47:04,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 143 SyntacticMatches, 9 SemanticMatches, 93 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2698 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=892, Invalid=7853, Unknown=1, NotChecked=184, Total=8930 [2022-12-14 04:47:04,308 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 261 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 112 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-12-14 04:47:04,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 369 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 922 Invalid, 3 Unknown, 114 Unchecked, 6.6s Time] [2022-12-14 04:47:04,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-12-14 04:47:04,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 170. [2022-12-14 04:47:04,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 115 states have (on average 1.208695652173913) internal successors, (139), 119 states have internal predecessors, (139), 33 states have call successors, (33), 19 states have call predecessors, (33), 21 states have return successors, (33), 31 states have call predecessors, (33), 31 states have call successors, (33) [2022-12-14 04:47:04,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 205 transitions. [2022-12-14 04:47:04,385 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 205 transitions. Word has length 65 [2022-12-14 04:47:04,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:47:04,385 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 205 transitions. [2022-12-14 04:47:04,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 3.1923076923076925) internal successors, (83), 27 states have internal predecessors, (83), 13 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (25), 11 states have call predecessors, (25), 13 states have call successors, (25) [2022-12-14 04:47:04,385 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 205 transitions. [2022-12-14 04:47:04,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-14 04:47:04,385 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:47:04,385 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:47:04,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 04:47:04,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 04:47:04,587 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:47:04,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:47:04,588 INFO L85 PathProgramCache]: Analyzing trace with hash 242292360, now seen corresponding path program 2 times [2022-12-14 04:47:04,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:47:04,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427281210] [2022-12-14 04:47:04,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:47:04,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:47:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:47:05,370 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 04:47:05,370 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:47:05,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427281210] [2022-12-14 04:47:05,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427281210] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:47:05,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99340956] [2022-12-14 04:47:05,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 04:47:05,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:47:05,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:47:05,371 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:47:05,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 04:47:05,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 04:47:05,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 04:47:05,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-14 04:47:05,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:47:09,076 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 04:47:09,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:47:11,574 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 04:47:11,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99340956] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 04:47:11,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [891708098] [2022-12-14 04:47:11,576 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-12-14 04:47:11,576 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 04:47:11,577 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 04:47:11,577 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 04:47:11,577 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 04:47:11,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,623 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-12-14 04:47:11,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2022-12-14 04:47:11,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-12-14 04:47:11,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-12-14 04:47:11,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2022-12-14 04:47:11,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2022-12-14 04:47:11,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2022-12-14 04:47:11,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,864 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:47:11,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,868 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:47:11,878 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 04:47:11,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 103 [2022-12-14 04:47:11,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,932 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-12-14 04:47:11,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 42 treesize of output 73 [2022-12-14 04:47:11,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 99 [2022-12-14 04:47:11,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:47:11,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:11,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2022-12-14 04:47:12,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:12,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:12,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 28 [2022-12-14 04:47:12,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:12,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 04:47:12,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:12,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 13 [2022-12-14 04:47:12,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:12,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 13 [2022-12-14 04:47:12,121 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:47:12,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:12,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 23 [2022-12-14 04:47:12,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 04:47:12,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 04:47:12,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:12,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:47:12,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:12,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:12,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2022-12-14 04:47:12,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:12,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:47:12,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:12,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 04:47:13,826 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 44 for LOIs [2022-12-14 04:47:13,845 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 19 for LOIs [2022-12-14 04:47:14,359 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 15 for LOIs [2022-12-14 04:47:14,360 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-12-14 04:47:14,372 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 20 for LOIs [2022-12-14 04:47:14,421 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 04:47:26,107 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10864#(and (<= 0 |__VERIFIER_assert_#in~cond|) (= |~#s_can_fail_allocator_static~0.base| 4) (= (mod __VERIFIER_assert_~cond 256) 0) (= |~#s_can_fail_allocator_static~0.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= ~tl_last_error~0 0) (= |#NULL.offset| 0) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_143| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_143| Int)) (and (<= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_143| 0) (<= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_143|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_143| 24)) 0) (<= 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_143|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_143| 24))) (<= 0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_143|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_143|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_143| 24))) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_143|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_143| 24))) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_143|) (<= 0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_143|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_143|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_143| 24))) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_143|) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_143| 24))) (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset_BEFORE_CALL_143| 16)))) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 04:47:26,107 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 04:47:26,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 04:47:26,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 7] total 26 [2022-12-14 04:47:26,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719274761] [2022-12-14 04:47:26,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 04:47:26,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 04:47:26,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:47:26,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 04:47:26,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2552, Unknown=2, NotChecked=0, Total=2756 [2022-12-14 04:47:26,111 INFO L87 Difference]: Start difference. First operand 170 states and 205 transitions. Second operand has 26 states, 24 states have (on average 2.875) internal successors, (69), 26 states have internal predecessors, (69), 11 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (25), 9 states have call predecessors, (25), 11 states have call successors, (25) [2022-12-14 04:47:28,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:47:30,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:47:32,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:47:35,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:47:39,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:47:39,177 INFO L93 Difference]: Finished difference Result 296 states and 363 transitions. [2022-12-14 04:47:39,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-14 04:47:39,178 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.875) internal successors, (69), 26 states have internal predecessors, (69), 11 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (25), 9 states have call predecessors, (25), 11 states have call successors, (25) Word has length 66 [2022-12-14 04:47:39,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:47:39,179 INFO L225 Difference]: With dead ends: 296 [2022-12-14 04:47:39,179 INFO L226 Difference]: Without dead ends: 231 [2022-12-14 04:47:39,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 155 SyntacticMatches, 8 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=429, Invalid=5119, Unknown=2, NotChecked=0, Total=5550 [2022-12-14 04:47:39,183 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 170 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 239 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-12-14 04:47:39,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 444 Invalid, 1678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 1436 Invalid, 3 Unknown, 0 Unchecked, 10.4s Time] [2022-12-14 04:47:39,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-12-14 04:47:39,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 171. [2022-12-14 04:47:39,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 116 states have (on average 1.1982758620689655) internal successors, (139), 120 states have internal predecessors, (139), 33 states have call successors, (33), 19 states have call predecessors, (33), 21 states have return successors, (33), 31 states have call predecessors, (33), 31 states have call successors, (33) [2022-12-14 04:47:39,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 205 transitions. [2022-12-14 04:47:39,278 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 205 transitions. Word has length 66 [2022-12-14 04:47:39,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:47:39,279 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 205 transitions. [2022-12-14 04:47:39,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.875) internal successors, (69), 26 states have internal predecessors, (69), 11 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (25), 9 states have call predecessors, (25), 11 states have call successors, (25) [2022-12-14 04:47:39,279 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 205 transitions. [2022-12-14 04:47:39,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 04:47:39,279 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:47:39,279 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:47:39,285 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-14 04:47:39,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:47:39,481 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:47:39,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:47:39,482 INFO L85 PathProgramCache]: Analyzing trace with hash 418573970, now seen corresponding path program 1 times [2022-12-14 04:47:39,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:47:39,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110941120] [2022-12-14 04:47:39,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:47:39,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:47:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:47:41,211 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 13 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 04:47:41,211 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:47:41,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110941120] [2022-12-14 04:47:41,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110941120] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:47:41,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013836069] [2022-12-14 04:47:41,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:47:41,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:47:41,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:47:41,212 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:47:41,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 04:47:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:47:41,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 136 conjunts are in the unsatisfiable core [2022-12-14 04:47:41,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:47:43,738 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 24 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:47:43,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:47:48,862 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_$Pointer$.offset| |c_aws_linked_list_node_next_is_valid_#in~node.base|) |c_aws_linked_list_node_next_is_valid_#in~node.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_node_next_is_valid_#in~node.base|) |c_aws_linked_list_node_next_is_valid_#in~node.offset|)) (.cse1 (+ 8 .cse12))) (or (not (= |c_aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) (and (forall ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_65| Int)) (or (forall ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_65| Int)) (let ((.cse3 (+ 8 (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_65|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_65|))) (.cse2 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_65|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_65|))) (or (not (= (select (select |c_#memory_$Pointer$.base| .cse2) .cse3) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_65|)) (not (= |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_65| (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3))) (= .cse2 0)))) (= |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_65| 0))) (forall ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_65| Int)) (or (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_65| 0) (forall ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_65| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_65|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_65|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_65|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_65|)) (.cse5 (+ 8 .cse6))) (or (not (= (select (select |c_#memory_$Pointer$.base| .cse4) .cse5) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_65|)) (not (= |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_65| (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5))) (= .cse6 0))))))) (forall ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_65| Int)) (or (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_65| 0) (forall ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_65| Int)) (let ((.cse8 (+ 8 (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_65|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_65|))) (.cse7 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_65|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_65|))) (or (not (= (select (select |c_#memory_$Pointer$.base| .cse7) .cse8) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_65|)) (not (= |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_65| (select (select |c_#memory_$Pointer$.offset| .cse7) .cse8))) (= .cse7 0)))))) (forall ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_65| Int)) (or (forall ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_65| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_65|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_65|))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_65|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_65|)) (.cse10 (+ 8 .cse11))) (or (not (= (select (select |c_#memory_$Pointer$.base| .cse9) .cse10) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_65|)) (not (= |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_65| (select (select |c_#memory_$Pointer$.offset| .cse9) .cse10))) (= .cse11 0))))) (= |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_65| 0)))) (and (= 0 |c_aws_linked_list_node_next_is_valid_#in~node.base|) (= |c_aws_linked_list_node_next_is_valid_#in~node.offset| 0)) (not (<= (mod |c_aws_linked_list_node_next_is_valid_#res| 256) 0)) (and (= .cse12 0) (= .cse0 0)) (not (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) |c_aws_linked_list_node_next_is_valid_#in~node.base|))))) is different from false [2022-12-14 04:47:52,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013836069] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:47:52,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1642970495] [2022-12-14 04:47:52,358 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-12-14 04:47:52,358 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 04:47:52,359 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 04:47:52,359 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 04:47:52,359 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 04:47:52,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:52,542 INFO L321 Elim1Store]: treesize reduction 30, result has 48.3 percent of original size [2022-12-14 04:47:52,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 50 [2022-12-14 04:47:52,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:52,717 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-12-14 04:47:52,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2022-12-14 04:47:52,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:52,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:52,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:52,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:52,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:52,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2022-12-14 04:47:52,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:52,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:52,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:52,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:52,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:52,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2022-12-14 04:47:52,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:52,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-12-14 04:47:53,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2022-12-14 04:47:53,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:53,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:53,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:53,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:53,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:53,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 101 [2022-12-14 04:47:53,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:53,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:47:53,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:53,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:53,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:53,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:53,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:53,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:53,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:53,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:53,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 99 [2022-12-14 04:47:53,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:53,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:47:53,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 28 [2022-12-14 04:48:00,456 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 153 for LOIs [2022-12-14 04:48:00,634 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 19 for LOIs [2022-12-14 04:48:01,126 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 135 for LOIs [2022-12-14 04:48:01,157 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-12-14 04:48:01,171 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 20 for LOIs [2022-12-14 04:48:01,222 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 04:48:38,984 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '11930#(and (= |#funAddr~s_can_fail_realloc_allocator.offset| (select (select |#memory_$Pointer$.offset| |~#s_can_fail_allocator_static~0.base|) (+ |~#s_can_fail_allocator_static~0.offset| 16))) (= (select |#length| 3) 12) (= 0 (select (select |#memory_$Pointer$.offset| |~#s_can_fail_allocator_static~0.base|) (+ |~#s_can_fail_allocator_static~0.offset| 32))) (= |~#s_can_fail_allocator_static~0.base| 4) (= |~#s_can_fail_allocator_static~0.offset| 0) (= |#funAddr~s_can_fail_malloc_allocator.base| (select (select |#memory_$Pointer$.base| |~#s_can_fail_allocator_static~0.base|) |~#s_can_fail_allocator_static~0.offset|)) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= (select (select |#memory_$Pointer$.offset| |~#s_can_fail_allocator_static~0.base|) (+ |~#s_can_fail_allocator_static~0.offset| 8)) |#funAddr~s_can_fail_free_allocator.offset|) (= (select (select |#memory_$Pointer$.base| |~#s_can_fail_allocator_static~0.base|) (+ |~#s_can_fail_allocator_static~0.offset| 32)) 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| 0) (<= ~tl_last_error~0 0) (= (select |#valid| 4) 1) (= |#funAddr~s_can_fail_calloc_allocator.base| (select (select |#memory_$Pointer$.base| |~#s_can_fail_allocator_static~0.base|) (+ |~#s_can_fail_allocator_static~0.offset| 24))) (= (select |#valid| 1) 1) (= |#funAddr~s_can_fail_realloc_allocator.base| (select (select |#memory_$Pointer$.base| |~#s_can_fail_allocator_static~0.base|) (+ |~#s_can_fail_allocator_static~0.offset| 16))) (<= 0 ~tl_last_error~0) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_96| Int)) (and (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_96|) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99|) 3)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_96|) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99|) 4)) (= 32 (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_96|) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_96|) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99|)) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_96|) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99|)) 0) (<= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99| 0) (<= 0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_96|) (<= 0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_96|) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99|)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_96|) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99|) (- 8))) 0) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_96|) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99|) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_96|) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_96|) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99|) 0)) (<= 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_96|) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99|)) (= (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99| 16) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_96|) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_96|) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99|)) (+ 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_96|) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99|))) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_96|) (< |#StackHeapBarrier| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_96|) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99|)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_96|) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99|) 2)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_96|) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99|)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_96|) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99|) (- 8))) 0) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_96|) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99|)) (+ 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_96|) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99|)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_96|) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99|)) 1) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_96|) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99|)) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_96|) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99|)) 0) (= 16 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_96|) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_BEFORE_CALL_99|)))) (= |#funAddr~s_can_fail_calloc_allocator.offset| (select (select |#memory_$Pointer$.offset| |~#s_can_fail_allocator_static~0.base|) (+ |~#s_can_fail_allocator_static~0.offset| 24))) (= (select |#valid| 0) 0) (= (select (select |#memory_$Pointer$.base| |~#s_can_fail_allocator_static~0.base|) (+ |~#s_can_fail_allocator_static~0.offset| 8)) |#funAddr~s_can_fail_free_allocator.base|) (= |#funAddr~s_can_fail_malloc_allocator.offset| (select (select |#memory_$Pointer$.offset| |~#s_can_fail_allocator_static~0.base|) |~#s_can_fail_allocator_static~0.offset|)) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select (select |#memory_int| 1) 0) 48) (= 40 (select |#length| 4)) (= 30 (select |#length| 2)) (= (select (select |#memory_int| 1) 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 04:48:38,984 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 04:48:38,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 04:48:38,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 29] total 42 [2022-12-14 04:48:38,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710311665] [2022-12-14 04:48:38,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 04:48:38,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-14 04:48:38,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:48:38,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-14 04:48:38,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=5417, Unknown=1, NotChecked=150, Total=6006 [2022-12-14 04:48:38,987 INFO L87 Difference]: Start difference. First operand 171 states and 205 transitions. Second operand has 42 states, 35 states have (on average 2.2285714285714286) internal successors, (78), 35 states have internal predecessors, (78), 15 states have call successors, (21), 4 states have call predecessors, (21), 11 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2022-12-14 04:48:50,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:48:50,372 INFO L93 Difference]: Finished difference Result 265 states and 320 transitions. [2022-12-14 04:48:50,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-14 04:48:50,373 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 35 states have (on average 2.2285714285714286) internal successors, (78), 35 states have internal predecessors, (78), 15 states have call successors, (21), 4 states have call predecessors, (21), 11 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) Word has length 67 [2022-12-14 04:48:50,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:48:50,375 INFO L225 Difference]: With dead ends: 265 [2022-12-14 04:48:50,375 INFO L226 Difference]: Without dead ends: 226 [2022-12-14 04:48:50,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 100 SyntacticMatches, 5 SemanticMatches, 99 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2778 ImplicationChecksByTransitivity, 49.2s TimeCoverageRelationStatistics Valid=844, Invalid=9059, Unknown=1, NotChecked=196, Total=10100 [2022-12-14 04:48:50,379 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 241 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 1529 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 1717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:48:50,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 527 Invalid, 1717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1529 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-12-14 04:48:50,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-12-14 04:48:50,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 171. [2022-12-14 04:48:50,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 116 states have (on average 1.1810344827586208) internal successors, (137), 120 states have internal predecessors, (137), 33 states have call successors, (33), 19 states have call predecessors, (33), 21 states have return successors, (33), 31 states have call predecessors, (33), 31 states have call successors, (33) [2022-12-14 04:48:50,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 203 transitions. [2022-12-14 04:48:50,462 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 203 transitions. Word has length 67 [2022-12-14 04:48:50,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:48:50,462 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 203 transitions. [2022-12-14 04:48:50,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 35 states have (on average 2.2285714285714286) internal successors, (78), 35 states have internal predecessors, (78), 15 states have call successors, (21), 4 states have call predecessors, (21), 11 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2022-12-14 04:48:50,463 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 203 transitions. [2022-12-14 04:48:50,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-14 04:48:50,463 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:48:50,463 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:48:50,469 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 04:48:50,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:48:50,664 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:48:50,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:48:50,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1289991631, now seen corresponding path program 1 times [2022-12-14 04:48:50,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:48:50,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807620201] [2022-12-14 04:48:50,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:48:50,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:48:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:48:50,937 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-12-14 04:48:50,937 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:48:50,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807620201] [2022-12-14 04:48:50,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807620201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:48:50,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:48:50,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 04:48:50,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294981508] [2022-12-14 04:48:50,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:48:50,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 04:48:50,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:48:50,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 04:48:50,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-14 04:48:50,939 INFO L87 Difference]: Start difference. First operand 171 states and 203 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-12-14 04:48:51,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:48:51,485 INFO L93 Difference]: Finished difference Result 193 states and 226 transitions. [2022-12-14 04:48:51,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 04:48:51,485 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 70 [2022-12-14 04:48:51,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:48:51,486 INFO L225 Difference]: With dead ends: 193 [2022-12-14 04:48:51,486 INFO L226 Difference]: Without dead ends: 191 [2022-12-14 04:48:51,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-14 04:48:51,486 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 10 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 04:48:51,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 306 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 04:48:51,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-12-14 04:48:51,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 181. [2022-12-14 04:48:51,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 122 states have (on average 1.1721311475409837) internal successors, (143), 126 states have internal predecessors, (143), 35 states have call successors, (35), 21 states have call predecessors, (35), 23 states have return successors, (35), 33 states have call predecessors, (35), 33 states have call successors, (35) [2022-12-14 04:48:51,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 213 transitions. [2022-12-14 04:48:51,559 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 213 transitions. Word has length 70 [2022-12-14 04:48:51,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:48:51,559 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 213 transitions. [2022-12-14 04:48:51,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-12-14 04:48:51,560 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 213 transitions. [2022-12-14 04:48:51,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-14 04:48:51,560 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:48:51,560 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:48:51,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 04:48:51,560 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:48:51,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:48:51,560 INFO L85 PathProgramCache]: Analyzing trace with hash -358000847, now seen corresponding path program 2 times [2022-12-14 04:48:51,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:48:51,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76725073] [2022-12-14 04:48:51,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:48:51,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:48:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:48:53,355 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 17 proven. 38 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 04:48:53,356 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:48:53,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76725073] [2022-12-14 04:48:53,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76725073] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:48:53,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040056345] [2022-12-14 04:48:53,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 04:48:53,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:48:53,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:48:53,357 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:48:53,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 04:48:53,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 04:48:53,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 04:48:53,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-14 04:48:53,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:49:19,890 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 04:49:20,385 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 57 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 04:49:20,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:49:22,509 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:49:22,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2022-12-14 04:49:22,547 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 04:49:22,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2022-12-14 04:49:22,793 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 35 proven. 21 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-14 04:49:22,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040056345] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 04:49:22,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1719774183] [2022-12-14 04:49:22,795 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-12-14 04:49:22,795 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 04:49:22,796 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 04:49:22,796 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 04:49:22,796 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 04:49:22,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:22,959 INFO L321 Elim1Store]: treesize reduction 30, result has 48.3 percent of original size [2022-12-14 04:49:22,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 50 [2022-12-14 04:49:22,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:23,142 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-12-14 04:49:23,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2022-12-14 04:49:23,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2022-12-14 04:49:23,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:23,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:23,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:23,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:23,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:23,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2022-12-14 04:49:23,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:23,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:23,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:23,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:23,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:23,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2022-12-14 04:49:23,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:23,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-12-14 04:49:23,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:49:23,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:23,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:23,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:23,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:23,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:23,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 101 [2022-12-14 04:49:23,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:23,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:23,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:23,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:23,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:23,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:23,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:23,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:23,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 99 [2022-12-14 04:49:23,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:23,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:49:23,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 28 [2022-12-14 04:49:31,204 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 145 for LOIs [2022-12-14 04:49:31,397 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 19 for LOIs [2022-12-14 04:49:31,954 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 31 for LOIs [2022-12-14 04:49:31,959 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-12-14 04:49:31,973 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 20 for LOIs [2022-12-14 04:49:32,016 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 04:50:05,572 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '13674#(and (= |#funAddr~s_can_fail_realloc_allocator.offset| (select (select |#memory_$Pointer$.offset| |~#s_can_fail_allocator_static~0.base|) (+ |~#s_can_fail_allocator_static~0.offset| 16))) (= (select |#length| 3) 12) (= 0 (select (select |#memory_$Pointer$.offset| |~#s_can_fail_allocator_static~0.base|) (+ |~#s_can_fail_allocator_static~0.offset| 32))) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |~#s_can_fail_allocator_static~0.base| 4) (= |#funAddr~s_can_fail_malloc_allocator.base| (select (select |#memory_$Pointer$.base| |~#s_can_fail_allocator_static~0.base|) |~#s_can_fail_allocator_static~0.offset|)) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (<= |#NULL.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#s_can_fail_allocator_static~0.base|) (+ |~#s_can_fail_allocator_static~0.offset| 8)) |#funAddr~s_can_fail_free_allocator.offset|) (= (select (select |#memory_$Pointer$.base| |~#s_can_fail_allocator_static~0.base|) (+ |~#s_can_fail_allocator_static~0.offset| 32)) 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| 0) (<= ~tl_last_error~0 0) (= (select |#valid| 4) 1) (= |#funAddr~s_can_fail_calloc_allocator.base| (select (select |#memory_$Pointer$.base| |~#s_can_fail_allocator_static~0.base|) (+ |~#s_can_fail_allocator_static~0.offset| 24))) (= (select |#valid| 1) 1) (= |#funAddr~s_can_fail_realloc_allocator.base| (select (select |#memory_$Pointer$.base| |~#s_can_fail_allocator_static~0.base|) (+ |~#s_can_fail_allocator_static~0.offset| 16))) (<= 0 ~tl_last_error~0) (= |#funAddr~s_can_fail_calloc_allocator.offset| (select (select |#memory_$Pointer$.offset| |~#s_can_fail_allocator_static~0.base|) (+ |~#s_can_fail_allocator_static~0.offset| 24))) (= (select |#valid| 0) 0) (= (select (select |#memory_$Pointer$.base| |~#s_can_fail_allocator_static~0.base|) (+ |~#s_can_fail_allocator_static~0.offset| 8)) |#funAddr~s_can_fail_free_allocator.base|) (= |#funAddr~s_can_fail_malloc_allocator.offset| (select (select |#memory_$Pointer$.offset| |~#s_can_fail_allocator_static~0.base|) |~#s_can_fail_allocator_static~0.offset|)) (= (select |#valid| 2) 1) (= (select (select |#memory_int| 1) 0) 48) (= 40 (select |#length| 4)) (<= 0 |#NULL.offset|) (= 30 (select |#length| 2)) (= (select (select |#memory_int| 1) 1) 0) (< 0 |#StackHeapBarrier|) (<= |~#s_can_fail_allocator_static~0.offset| 0) (= |#NULL.base| 0) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_112| Int)) (and (<= 0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_112|) (< |#StackHeapBarrier| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_112|) 0)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_112|) 0) 4)) (= 16 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_112|) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_112|) 0)) 16) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_112|) 0)) 8) 0) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_112|) 0) 2)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_112|) 0)) 24) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_112|) 0)) 16) 0) (= 32 (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_112|) 0))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_112|) 0)) 1) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_112|) 0) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_112|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_112|) 0)) 8) 0) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_112|) 0) 0)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_112|) 0)) 24) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_112|) (<= 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_112|) 0)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_BEFORE_CALL_112|) 0) 3)))))' at error location [2022-12-14 04:50:05,572 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 04:50:05,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 04:50:05,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 13] total 36 [2022-12-14 04:50:05,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717752749] [2022-12-14 04:50:05,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 04:50:05,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 04:50:05,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:50:05,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 04:50:05,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=3509, Unknown=7, NotChecked=0, Total=3906 [2022-12-14 04:50:05,574 INFO L87 Difference]: Start difference. First operand 181 states and 213 transitions. Second operand has 36 states, 33 states have (on average 2.757575757575758) internal successors, (91), 35 states have internal predecessors, (91), 17 states have call successors, (31), 4 states have call predecessors, (31), 8 states have return successors, (30), 15 states have call predecessors, (30), 16 states have call successors, (30) [2022-12-14 04:50:26,220 WARN L233 SmtUtils]: Spent 20.15s on a formula simplification. DAG size of input: 45 DAG size of output: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 04:50:36,411 WARN L233 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 04:50:46,609 WARN L233 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 04:50:56,799 WARN L233 SmtUtils]: Spent 10.07s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 04:51:17,123 WARN L233 SmtUtils]: Spent 20.16s on a formula simplification. DAG size of input: 50 DAG size of output: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 04:51:27,609 WARN L233 SmtUtils]: Spent 10.08s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 04:51:48,814 WARN L233 SmtUtils]: Spent 20.16s on a formula simplification. DAG size of input: 54 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 04:51:50,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:51:50,342 INFO L93 Difference]: Finished difference Result 274 states and 320 transitions. [2022-12-14 04:51:50,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 04:51:50,343 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 2.757575757575758) internal successors, (91), 35 states have internal predecessors, (91), 17 states have call successors, (31), 4 states have call predecessors, (31), 8 states have return successors, (30), 15 states have call predecessors, (30), 16 states have call successors, (30) Word has length 73 [2022-12-14 04:51:50,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:51:50,344 INFO L225 Difference]: With dead ends: 274 [2022-12-14 04:51:50,344 INFO L226 Difference]: Without dead ends: 198 [2022-12-14 04:51:50,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 172 SyntacticMatches, 10 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2138 ImplicationChecksByTransitivity, 163.2s TimeCoverageRelationStatistics Valid=599, Invalid=5246, Unknown=7, NotChecked=0, Total=5852 [2022-12-14 04:51:50,345 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 241 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-12-14 04:51:50,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 627 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-12-14 04:51:50,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-12-14 04:51:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 170. [2022-12-14 04:51:50,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 115 states have (on average 1.1217391304347826) internal successors, (129), 118 states have internal predecessors, (129), 32 states have call successors, (32), 21 states have call predecessors, (32), 22 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-12-14 04:51:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 192 transitions. [2022-12-14 04:51:50,421 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 192 transitions. Word has length 73 [2022-12-14 04:51:50,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:51:50,421 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 192 transitions. [2022-12-14 04:51:50,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 2.757575757575758) internal successors, (91), 35 states have internal predecessors, (91), 17 states have call successors, (31), 4 states have call predecessors, (31), 8 states have return successors, (30), 15 states have call predecessors, (30), 16 states have call successors, (30) [2022-12-14 04:51:50,421 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 192 transitions. [2022-12-14 04:51:50,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-14 04:51:50,422 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:51:50,422 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:51:50,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 04:51:50,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 04:51:50,624 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:51:50,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:51:50,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1472651218, now seen corresponding path program 1 times [2022-12-14 04:51:50,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:51:50,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901938618] [2022-12-14 04:51:50,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:51:50,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:51:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:51:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-14 04:51:50,915 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:51:50,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901938618] [2022-12-14 04:51:50,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901938618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:51:50,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:51:50,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 04:51:50,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913409790] [2022-12-14 04:51:50,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:51:50,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 04:51:50,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:51:50,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 04:51:50,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 04:51:50,917 INFO L87 Difference]: Start difference. First operand 170 states and 192 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 04:51:51,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:51:51,242 INFO L93 Difference]: Finished difference Result 180 states and 201 transitions. [2022-12-14 04:51:51,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 04:51:51,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 76 [2022-12-14 04:51:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:51:51,243 INFO L225 Difference]: With dead ends: 180 [2022-12-14 04:51:51,243 INFO L226 Difference]: Without dead ends: 178 [2022-12-14 04:51:51,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 04:51:51,244 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:51:51,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 161 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 04:51:51,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-12-14 04:51:51,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2022-12-14 04:51:51,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 121 states have (on average 1.115702479338843) internal successors, (135), 124 states have internal predecessors, (135), 32 states have call successors, (32), 23 states have call predecessors, (32), 24 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-12-14 04:51:51,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 198 transitions. [2022-12-14 04:51:51,313 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 198 transitions. Word has length 76 [2022-12-14 04:51:51,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:51:51,314 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 198 transitions. [2022-12-14 04:51:51,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 04:51:51,314 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 198 transitions. [2022-12-14 04:51:51,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-14 04:51:51,314 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:51:51,314 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:51:51,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 04:51:51,315 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:51:51,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:51:51,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1828961022, now seen corresponding path program 1 times [2022-12-14 04:51:51,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:51:51,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087433104] [2022-12-14 04:51:51,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:51:51,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:51:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:51:55,127 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 6 proven. 61 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-12-14 04:51:55,127 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:51:55,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087433104] [2022-12-14 04:51:55,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087433104] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:51:55,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403739247] [2022-12-14 04:51:55,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:51:55,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:51:55,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:51:55,129 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:51:55,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f007a3f3-bff6-4cec-bd5b-49a42d3270a7/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 04:51:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:51:55,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 143 conjunts are in the unsatisfiable core [2022-12-14 04:51:55,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:51:55,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-14 04:51:55,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:51:55,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 04:51:56,224 INFO L321 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2022-12-14 04:51:56,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 100 [2022-12-14 04:51:56,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:51:56,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 72 [2022-12-14 04:51:56,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-12-14 04:51:56,557 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| Int) (v_DerPreprocessor_90 (Array Int Int)) (v_DerPreprocessor_89 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|))) (let ((.cse0 (select .cse1 0))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|) (not (= .cse0 0)) (= (select .cse1 24) (select v_DerPreprocessor_90 24)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_89) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| v_DerPreprocessor_90) .cse0 v_DerPreprocessor_89) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| v_DerPreprocessor_90) .cse0)))))) is different from true [2022-12-14 04:51:58,833 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_91 (Array Int Int)) (v_DerPreprocessor_92 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|))) (let ((.cse0 (select .cse1 0))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|) (= (select .cse1 24) (select v_DerPreprocessor_91 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|) (not (= .cse0 0)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_92) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| v_DerPreprocessor_91) .cse0 v_DerPreprocessor_92) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| v_DerPreprocessor_91) .cse0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| Int) (v_DerPreprocessor_90 (Array Int Int)) (v_DerPreprocessor_89 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|))) (let ((.cse2 (select .cse3 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|) (<= (+ .cse2 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|) (not (= .cse2 0)) (= (select v_DerPreprocessor_90 24) (select .cse3 24)) (= (select |c_#memory_$Pointer$.base| .cse2) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_89) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_90) .cse2 v_DerPreprocessor_89) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_90) .cse2))))))) is different from true [2022-12-14 04:51:58,918 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_91 (Array Int Int)) (v_DerPreprocessor_92 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|))) (let ((.cse0 (select .cse1 0))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|) (= (select .cse1 24) (select v_DerPreprocessor_91 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|) (not (= .cse0 0)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_92) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| v_DerPreprocessor_91) .cse0 v_DerPreprocessor_92) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| v_DerPreprocessor_91) .cse0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| Int) (v_DerPreprocessor_90 (Array Int Int)) (v_DerPreprocessor_89 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|))) (let ((.cse2 (select .cse3 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|) (<= (+ .cse2 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|) (not (= .cse2 0)) (= (select v_DerPreprocessor_90 24) (select .cse3 24)) (= (select |c_#memory_$Pointer$.base| .cse2) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_89) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_90) .cse2 v_DerPreprocessor_89) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_90) .cse2)))))) (not (= (mod |c_assume_abort_if_not_#in~cond| 256) 0))) is different from true [2022-12-14 04:51:59,867 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_91 (Array Int Int)) (v_DerPreprocessor_92 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|))) (let ((.cse0 (select .cse1 0))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|) (= (select .cse1 24) (select v_DerPreprocessor_91 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|) (not (= .cse0 0)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_92) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| v_DerPreprocessor_91) .cse0 v_DerPreprocessor_92) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| v_DerPreprocessor_91) .cse0)))))) (exists ((v_DerPreprocessor_93 (Array Int Int)) (v_DerPreprocessor_94 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101| Int)) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101|))) (let ((.cse2 (select .cse3 0))) (and (<= (+ .cse2 2) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101|) (= (select .cse3 24) (select v_DerPreprocessor_93 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_94) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101| v_DerPreprocessor_93) .cse2 v_DerPreprocessor_94) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101| v_DerPreprocessor_93) .cse2) (select |c_#memory_$Pointer$.base| .cse2)) (not (= .cse2 0)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101|))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| Int) (v_DerPreprocessor_90 (Array Int Int)) (v_DerPreprocessor_89 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|))) (let ((.cse4 (select .cse5 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|) (<= (+ .cse4 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|) (not (= .cse4 0)) (= (select v_DerPreprocessor_90 24) (select .cse5 24)) (= (select |c_#memory_$Pointer$.base| .cse4) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_89) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_90) .cse4 v_DerPreprocessor_89) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_90) .cse4))))))) is different from true [2022-12-14 04:52:06,960 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_91 (Array Int Int)) (v_DerPreprocessor_92 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|))) (let ((.cse0 (select .cse1 0))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|) (= (select .cse1 24) (select v_DerPreprocessor_91 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|) (not (= .cse0 0)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_92) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| v_DerPreprocessor_91) .cse0 v_DerPreprocessor_92) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| v_DerPreprocessor_91) .cse0)))))) (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88| Int)) (and (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|)) (.cse3 (+ .cse4 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse2) .cse3) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) (not (= .cse4 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|))))) (not (= |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88| 0)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88| Int)) (and (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|)) (.cse6 (+ .cse7 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse5) .cse6) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) (not (= .cse7 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|))))) (not (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88| 0)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88| Int)) (and (not (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88| 0)) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|)) (.cse9 (+ (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse8) .cse9) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) (not (= .cse8 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|)))))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88| Int)) (and (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|)) (.cse11 (+ (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse10) .cse11) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) (not (= .cse10 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse10) .cse11) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|)))) (not (= |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88| 0))))) (exists ((v_DerPreprocessor_93 (Array Int Int)) (v_DerPreprocessor_94 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101| Int)) (let ((.cse13 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101|))) (let ((.cse12 (select .cse13 0))) (and (<= (+ .cse12 2) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101|) (= (select .cse13 24) (select v_DerPreprocessor_93 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_94) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101| v_DerPreprocessor_93) .cse12 v_DerPreprocessor_94) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101| v_DerPreprocessor_93) .cse12) (select |c_#memory_$Pointer$.base| .cse12)) (not (= .cse12 0)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101|))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| Int) (v_DerPreprocessor_90 (Array Int Int)) (v_DerPreprocessor_89 (Array Int Int))) (let ((.cse15 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|))) (let ((.cse14 (select .cse15 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|) (<= (+ .cse14 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|) (not (= .cse14 0)) (= (select v_DerPreprocessor_90 24) (select .cse15 24)) (= (select |c_#memory_$Pointer$.base| .cse14) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse14 v_DerPreprocessor_89) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_90) .cse14 v_DerPreprocessor_89) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_90) .cse14))))))) is different from true [2022-12-14 04:52:09,899 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse18 (select (select |c_#memory_$Pointer$.offset| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|))) (let ((.cse13 (+ .cse18 8)) (.cse12 (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|))) (and (exists ((v_DerPreprocessor_91 (Array Int Int)) (v_DerPreprocessor_92 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|))) (let ((.cse0 (select .cse1 0))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|) (= (select .cse1 24) (select v_DerPreprocessor_91 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|) (not (= .cse0 0)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_92) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| v_DerPreprocessor_91) .cse0 v_DerPreprocessor_92) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| v_DerPreprocessor_91) .cse0)))))) (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88| Int)) (and (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|)) (.cse3 (+ .cse4 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse2) .cse3) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) (not (= .cse4 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|))))) (not (= |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88| 0)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88| Int)) (and (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|)) (.cse6 (+ .cse7 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse5) .cse6) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) (not (= .cse7 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|))))) (not (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88| 0)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88| Int)) (and (not (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88| 0)) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|)) (.cse9 (+ (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse8) .cse9) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) (not (= .cse8 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|)))))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88| Int)) (and (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|)) (.cse11 (+ (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse10) .cse11) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) (not (= .cse10 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse10) .cse11) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|)))) (not (= |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88| 0))))) (= |c_aws_linked_list_is_valid_#in~list#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse12) .cse13)) (= |c_aws_linked_list_is_valid_#in~list#1.base| (select (select |c_#memory_$Pointer$.base| .cse12) .cse13)) (exists ((v_DerPreprocessor_93 (Array Int Int)) (v_DerPreprocessor_94 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101| Int)) (let ((.cse15 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101|))) (let ((.cse14 (select .cse15 0))) (and (<= (+ .cse14 2) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101|) (= (select .cse15 24) (select v_DerPreprocessor_93 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse14 v_DerPreprocessor_94) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101| v_DerPreprocessor_93) .cse14 v_DerPreprocessor_94) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101| v_DerPreprocessor_93) .cse14) (select |c_#memory_$Pointer$.base| .cse14)) (not (= .cse14 0)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101|))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| Int) (v_DerPreprocessor_90 (Array Int Int)) (v_DerPreprocessor_89 (Array Int Int))) (let ((.cse17 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|))) (let ((.cse16 (select .cse17 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|) (<= (+ .cse16 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|) (not (= .cse16 0)) (= (select v_DerPreprocessor_90 24) (select .cse17 24)) (= (select |c_#memory_$Pointer$.base| .cse16) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse16 v_DerPreprocessor_89) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_90) .cse16 v_DerPreprocessor_89) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_90) .cse16)))))) (or (not (= |c_aws_linked_list_is_valid_#in~list#1.offset| 0)) (not (= |c_aws_linked_list_is_valid_#in~list#1.base| 0))) (or (not (= .cse12 0)) (not (= .cse18 0)))))) is different from true [2022-12-14 04:53:00,337 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_91 (Array Int Int)) (v_DerPreprocessor_92 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|))) (let ((.cse0 (select .cse1 0))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|) (= (select .cse1 24) (select v_DerPreprocessor_91 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|) (not (= .cse0 0)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_92) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| v_DerPreprocessor_91) .cse0 v_DerPreprocessor_92) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| v_DerPreprocessor_91) .cse0)))))) (exists ((v_DerPreprocessor_93 (Array Int Int)) (v_DerPreprocessor_94 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_102| Int)) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_102|))) (let ((.cse3 (select .cse5 0))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse3)) (.cse4 (+ 8 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_102|) 0)))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_102|) (= .cse2 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_94) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_102| v_DerPreprocessor_93) .cse3 v_DerPreprocessor_94) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_102| v_DerPreprocessor_93) .cse3)) (<= (+ 2 .cse3) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_102|) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) 0) (= (select .cse2 .cse4) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_102|) (= (select .cse5 24) (select v_DerPreprocessor_93 24)) (not (= .cse3 0))))))) (exists ((v_DerPreprocessor_95 (Array Int Int)) (v_DerPreprocessor_96 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101| Int)) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101|))) (let ((.cse6 (select .cse7 0))) (and (<= (+ .cse6 2) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101|) (= (select |c_#memory_$Pointer$.base| .cse6) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_96) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101| v_DerPreprocessor_95) .cse6 v_DerPreprocessor_96) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101| v_DerPreprocessor_95) .cse6)) (not (= .cse6 0)) (= (select .cse7 24) (select v_DerPreprocessor_95 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101|))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| Int) (v_DerPreprocessor_90 (Array Int Int)) (v_DerPreprocessor_89 (Array Int Int))) (let ((.cse9 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|))) (let ((.cse8 (select .cse9 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|) (<= (+ .cse8 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|) (not (= .cse8 0)) (= (select v_DerPreprocessor_90 24) (select .cse9 24)) (= (select |c_#memory_$Pointer$.base| .cse8) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_89) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_90) .cse8 v_DerPreprocessor_89) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_90) .cse8))))))) is different from true [2022-12-14 04:53:04,026 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_91 (Array Int Int)) (v_DerPreprocessor_92 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|))) (let ((.cse0 (select .cse1 0))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|) (= (select .cse1 24) (select v_DerPreprocessor_91 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|) (not (= .cse0 0)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_92) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| v_DerPreprocessor_91) .cse0 v_DerPreprocessor_92) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| v_DerPreprocessor_91) .cse0)))))) (exists ((v_DerPreprocessor_93 (Array Int Int)) (v_DerPreprocessor_94 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_102| Int)) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_102|))) (let ((.cse3 (select .cse5 0))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse3)) (.cse4 (+ 8 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_102|) 0)))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_102|) (= .cse2 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_94) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_102| v_DerPreprocessor_93) .cse3 v_DerPreprocessor_94) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_102| v_DerPreprocessor_93) .cse3)) (<= (+ 2 .cse3) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_102|) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) 0) (= (select .cse2 .cse4) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_102|) (= (select .cse5 24) (select v_DerPreprocessor_93 24)) (not (= .cse3 0))))))) (exists ((v_DerPreprocessor_97 (Array Int Int)) (v_DerPreprocessor_98 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_103| Int)) (let ((.cse9 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_103|))) (let ((.cse8 (select .cse9 0))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse8)) (.cse7 (+ 8 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_103|) 0)))) (and (= (select .cse6 .cse7) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_103|) (not (= .cse8 0)) (= (select v_DerPreprocessor_97 24) (select .cse9 24)) (= .cse6 (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_98) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_103| v_DerPreprocessor_97) .cse8 v_DerPreprocessor_98) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_103| v_DerPreprocessor_97) .cse8)) (<= (+ 2 .cse8) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_103|) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_103|) (= (select (select |c_#memory_$Pointer$.offset| .cse8) .cse7) 0)))))) (exists ((v_DerPreprocessor_95 (Array Int Int)) (v_DerPreprocessor_96 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101| Int)) (let ((.cse11 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101|))) (let ((.cse10 (select .cse11 0))) (and (<= (+ .cse10 2) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101|) (= (select |c_#memory_$Pointer$.base| .cse10) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_96) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101| v_DerPreprocessor_95) .cse10 v_DerPreprocessor_96) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101| v_DerPreprocessor_95) .cse10)) (not (= .cse10 0)) (= (select .cse11 24) (select v_DerPreprocessor_95 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101|))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| Int) (v_DerPreprocessor_90 (Array Int Int)) (v_DerPreprocessor_89 (Array Int Int))) (let ((.cse13 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|))) (let ((.cse12 (select .cse13 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|) (<= (+ .cse12 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|) (not (= .cse12 0)) (= (select v_DerPreprocessor_90 24) (select .cse13 24)) (= (select |c_#memory_$Pointer$.base| .cse12) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_89) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_90) .cse12 v_DerPreprocessor_89) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_90) .cse12))))))) is different from true [2022-12-14 04:53:23,681 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 15 refuted. 17 times theorem prover too weak. 4 trivial. 72 not checked. [2022-12-14 04:53:23,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:54:34,403 INFO L321 Elim1Store]: treesize reduction 8, result has 90.6 percent of original size [2022-12-14 04:54:34,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 140 [2022-12-14 04:54:49,300 WARN L233 SmtUtils]: Spent 9.05s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 04:54:49,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403739247] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:54:49,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [579915988] [2022-12-14 04:54:49,304 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-12-14 04:54:49,304 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 04:54:49,305 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 04:54:49,305 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 04:54:49,305 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 04:54:49,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:49,913 INFO L321 Elim1Store]: treesize reduction 30, result has 48.3 percent of original size [2022-12-14 04:54:49,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 50 [2022-12-14 04:54:49,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:50,529 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-12-14 04:54:50,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2022-12-14 04:54:50,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2022-12-14 04:54:50,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:50,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-12-14 04:54:50,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:50,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:50,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:50,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2022-12-14 04:54:51,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2022-12-14 04:54:51,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,233 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:54:51,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,277 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:54:51,442 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 04:54:51,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 103 [2022-12-14 04:54:51,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,598 INFO L217 Elim1Store]: Index analysis took 106 ms [2022-12-14 04:54:51,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:54:51,822 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 04:54:51,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 103 [2022-12-14 04:54:51,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:54:51,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:51,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 28 [2022-12-14 04:54:52,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:52,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:52,832 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-12-14 04:54:52,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 42 treesize of output 73 [2022-12-14 04:54:52,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:52,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:52,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2022-12-14 04:54:53,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:53,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 04:54:53,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:53,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 13 [2022-12-14 04:54:53,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:53,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 13 [2022-12-14 04:54:53,207 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 04:54:53,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:53,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 23 [2022-12-14 04:54:53,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 04:54:53,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 04:54:53,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:53,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:53,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2022-12-14 04:54:53,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:53,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:54:53,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:53,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-12-14 04:54:53,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:54:53,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2022-12-14 04:54:54,794 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 34 for LOIs [2022-12-14 04:54:54,825 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_is_valid with input of size 58 for LOIs [2022-12-14 04:54:56,094 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 31 for LOIs [2022-12-14 04:54:56,103 INFO L197 IcfgInterpreter]: Interpreting procedure nondet_uint64_t with input of size 104 for LOIs [2022-12-14 04:54:56,126 INFO L197 IcfgInterpreter]: Interpreting procedure aws_linked_list_node_next_is_valid with input of size 20 for LOIs [2022-12-14 04:54:56,186 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 04:56:14,595 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '15319#(and (= |~#s_can_fail_allocator_static~0.base| 4) (= |~#s_can_fail_allocator_static~0.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| 0) (= ~tl_last_error~0 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 04:56:14,595 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 04:56:14,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 04:56:14,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 37] total 55 [2022-12-14 04:56:14,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281191894] [2022-12-14 04:56:14,595 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 04:56:14,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-12-14 04:56:14,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:56:14,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-12-14 04:56:14,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=6608, Unknown=68, NotChecked=1368, Total=8372 [2022-12-14 04:56:14,599 INFO L87 Difference]: Start difference. First operand 178 states and 198 transitions. Second operand has 55 states, 44 states have (on average 2.022727272727273) internal successors, (89), 44 states have internal predecessors, (89), 20 states have call successors, (23), 9 states have call predecessors, (23), 16 states have return successors, (23), 18 states have call predecessors, (23), 19 states have call successors, (23) [2022-12-14 04:56:33,264 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| Int) (v_DerPreprocessor_90 (Array Int Int)) (v_DerPreprocessor_89 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|))) (let ((.cse0 (select .cse1 0))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|) (not (= .cse0 0)) (= (select .cse1 24) (select v_DerPreprocessor_90 24)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_89) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| v_DerPreprocessor_90) .cse0 v_DerPreprocessor_89) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| v_DerPreprocessor_90) .cse0))))))) is different from true [2022-12-14 04:56:49,542 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_DerPreprocessor_91 (Array Int Int)) (v_DerPreprocessor_92 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|))) (let ((.cse0 (select .cse1 0))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|) (= (select .cse1 24) (select v_DerPreprocessor_91 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|) (not (= .cse0 0)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_92) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| v_DerPreprocessor_91) .cse0 v_DerPreprocessor_92) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| v_DerPreprocessor_91) .cse0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| Int) (v_DerPreprocessor_90 (Array Int Int)) (v_DerPreprocessor_89 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|))) (let ((.cse2 (select .cse3 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|) (<= (+ .cse2 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|) (not (= .cse2 0)) (= (select v_DerPreprocessor_90 24) (select .cse3 24)) (= (select |c_#memory_$Pointer$.base| .cse2) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_89) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_90) .cse2 v_DerPreprocessor_89) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_90) .cse2))))))) is different from true [2022-12-14 04:57:02,699 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_DerPreprocessor_91 (Array Int Int)) (v_DerPreprocessor_92 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|))) (let ((.cse0 (select .cse1 0))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|) (= (select .cse1 24) (select v_DerPreprocessor_91 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|) (not (= .cse0 0)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_92) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| v_DerPreprocessor_91) .cse0 v_DerPreprocessor_92) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| v_DerPreprocessor_91) .cse0)))))) (exists ((v_DerPreprocessor_93 (Array Int Int)) (v_DerPreprocessor_94 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101| Int)) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101|))) (let ((.cse2 (select .cse3 0))) (and (<= (+ .cse2 2) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101|) (= (select .cse3 24) (select v_DerPreprocessor_93 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_94) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101| v_DerPreprocessor_93) .cse2 v_DerPreprocessor_94) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101| v_DerPreprocessor_93) .cse2) (select |c_#memory_$Pointer$.base| .cse2)) (not (= .cse2 0)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101|))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| Int) (v_DerPreprocessor_90 (Array Int Int)) (v_DerPreprocessor_89 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|))) (let ((.cse4 (select .cse5 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|) (<= (+ .cse4 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|) (not (= .cse4 0)) (= (select v_DerPreprocessor_90 24) (select .cse5 24)) (= (select |c_#memory_$Pointer$.base| .cse4) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_89) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_90) .cse4 v_DerPreprocessor_89) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_90) .cse4))))))) is different from true [2022-12-14 04:57:10,919 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (exists ((v_DerPreprocessor_91 (Array Int Int)) (v_DerPreprocessor_92 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|))) (let ((.cse0 (select .cse1 0))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|) (= (select .cse1 24) (select v_DerPreprocessor_91 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|) (not (= .cse0 0)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_92) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| v_DerPreprocessor_91) .cse0 v_DerPreprocessor_92) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| v_DerPreprocessor_91) .cse0)))))) (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88| Int)) (and (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|)) (.cse3 (+ .cse4 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse2) .cse3) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) (not (= .cse4 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|))))) (not (= |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88| 0)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88| Int)) (and (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|)) (.cse6 (+ .cse7 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse5) .cse6) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) (not (= .cse7 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|))))) (not (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88| 0)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88| Int)) (and (not (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88| 0)) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|)) (.cse9 (+ (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse8) .cse9) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) (not (= .cse8 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|)))))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88| Int)) (and (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|)) (.cse11 (+ (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse10) .cse11) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) (not (= .cse10 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse10) .cse11) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|)))) (not (= |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88| 0))))) (exists ((v_DerPreprocessor_93 (Array Int Int)) (v_DerPreprocessor_94 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101| Int)) (let ((.cse13 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101|))) (let ((.cse12 (select .cse13 0))) (and (<= (+ .cse12 2) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101|) (= (select .cse13 24) (select v_DerPreprocessor_93 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_94) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101| v_DerPreprocessor_93) .cse12 v_DerPreprocessor_94) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101| v_DerPreprocessor_93) .cse12) (select |c_#memory_$Pointer$.base| .cse12)) (not (= .cse12 0)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101|))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| Int) (v_DerPreprocessor_90 (Array Int Int)) (v_DerPreprocessor_89 (Array Int Int))) (let ((.cse15 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|))) (let ((.cse14 (select .cse15 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|) (<= (+ .cse14 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|) (not (= .cse14 0)) (= (select v_DerPreprocessor_90 24) (select .cse15 24)) (= (select |c_#memory_$Pointer$.base| .cse14) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse14 v_DerPreprocessor_89) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_90) .cse14 v_DerPreprocessor_89) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_90) .cse14))))))) is different from true [2022-12-14 04:57:38,144 WARN L233 SmtUtils]: Spent 19.75s on a formula simplification that was a NOOP. DAG size: 139 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 04:57:53,917 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse18 (select (select |c_#memory_$Pointer$.offset| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|))) (let ((.cse13 (+ .cse18 8)) (.cse12 (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_is_valid_#in~list#1.base|) |c_aws_linked_list_is_valid_#in~list#1.offset|))) (and (< 0 |c_#StackHeapBarrier|) (exists ((v_DerPreprocessor_91 (Array Int Int)) (v_DerPreprocessor_92 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|))) (let ((.cse0 (select .cse1 0))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|) (= (select .cse1 24) (select v_DerPreprocessor_91 24)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241|) (not (= .cse0 0)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_92) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| v_DerPreprocessor_91) .cse0 v_DerPreprocessor_92) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_241| v_DerPreprocessor_91) .cse0)))))) (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88| Int)) (and (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|)) (.cse3 (+ .cse4 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse2) .cse3) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) (not (= .cse4 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|))))) (not (= |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88| 0)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88| Int)) (and (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|)) (.cse6 (+ .cse7 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse5) .cse6) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) (not (= .cse7 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|))))) (not (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88| 0)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88| Int)) (and (not (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88| 0)) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|)) (.cse9 (+ (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse8) .cse9) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) (not (= .cse8 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|)))))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88| Int)) (and (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|)) (.cse11 (+ (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse10) .cse11) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_88|) (not (= .cse10 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse10) .cse11) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88|)))) (not (= |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_88| 0))))) (= |c_aws_linked_list_is_valid_#in~list#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse12) .cse13)) (= |c_aws_linked_list_is_valid_#in~list#1.base| (select (select |c_#memory_$Pointer$.base| .cse12) .cse13)) (exists ((v_DerPreprocessor_93 (Array Int Int)) (v_DerPreprocessor_94 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101| Int)) (let ((.cse15 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101|))) (let ((.cse14 (select .cse15 0))) (and (<= (+ .cse14 2) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101|) (= (select .cse15 24) (select v_DerPreprocessor_93 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse14 v_DerPreprocessor_94) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101| v_DerPreprocessor_93) .cse14 v_DerPreprocessor_94) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101| v_DerPreprocessor_93) .cse14) (select |c_#memory_$Pointer$.base| .cse14)) (not (= .cse14 0)) (<= 2 |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_101|))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| Int) (v_DerPreprocessor_90 (Array Int Int)) (v_DerPreprocessor_89 (Array Int Int))) (let ((.cse17 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|))) (let ((.cse16 (select .cse17 0))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|) (<= (+ .cse16 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242|) (not (= .cse16 0)) (= (select v_DerPreprocessor_90 24) (select .cse17 24)) (= (select |c_#memory_$Pointer$.base| .cse16) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse16 v_DerPreprocessor_89) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_90) .cse16 v_DerPreprocessor_89) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_242| v_DerPreprocessor_90) .cse16)))))) (or (not (= |c_aws_linked_list_is_valid_#in~list#1.offset| 0)) (not (= |c_aws_linked_list_is_valid_#in~list#1.base| 0))) (or (not (= .cse12 0)) (not (= .cse18 0)))))) is different from true [2022-12-14 04:58:13,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:58:15,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:58:17,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:58:20,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:58:22,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:58:24,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 04:58:26,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]