./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 364b54724e976c015f9881f66521e5c6d863e13e3a8324ac15c0186b650523fa --- 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-13 11:18:23,057 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:18:23,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:18:23,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:18:23,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:18:23,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:18:23,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:18:23,077 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:18:23,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:18:23,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:18:23,079 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:18:23,080 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:18:23,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:18:23,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:18:23,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:18:23,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:18:23,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:18:23,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:18:23,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:18:23,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:18:23,087 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:18:23,088 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:18:23,088 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:18:23,089 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:18:23,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:18:23,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:18:23,092 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:18:23,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:18:23,093 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:18:23,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:18:23,093 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:18:23,094 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:18:23,094 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:18:23,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:18:23,095 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:18:23,096 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:18:23,096 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:18:23,096 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:18:23,097 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:18:23,097 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:18:23,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:18:23,098 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-12-13 11:18:23,117 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:18:23,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:18:23,118 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 11:18:23,119 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 11:18:23,120 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 11:18:23,120 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 11:18:23,121 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:18:23,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:18:23,121 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:18:23,121 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:18:23,121 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:18:23,122 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:18:23,122 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:18:23,122 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:18:23,122 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:18:23,122 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:18:23,123 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:18:23,123 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:18:23,123 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:18:23,123 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:18:23,123 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:18:23,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:18:23,124 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:18:23,124 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:18:23,124 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:18:23,124 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:18:23,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:18:23,125 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 11:18:23,125 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 11:18:23,125 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 11:18:23,125 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 11:18:23,125 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 11:18:23,125 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/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_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 364b54724e976c015f9881f66521e5c6d863e13e3a8324ac15c0186b650523fa [2022-12-13 11:18:23,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:18:23,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:18:23,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:18:23,372 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:18:23,372 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:18:23,373 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i [2022-12-13 11:18:25,971 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:18:26,363 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:18:26,364 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i [2022-12-13 11:18:26,391 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/data/f98b338b1/96f8b1620e14463c969ac9183b362cb3/FLAG23b96b2ab [2022-12-13 11:18:26,403 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/data/f98b338b1/96f8b1620e14463c969ac9183b362cb3 [2022-12-13 11:18:26,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:18:26,406 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 11:18:26,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:18:26,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:18:26,410 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:18:26,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:18:26" (1/1) ... [2022-12-13 11:18:26,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3217b052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:18:26, skipping insertion in model container [2022-12-13 11:18:26,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:18:26" (1/1) ... [2022-12-13 11:18:26,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:18:26,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:18:26,678 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_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i[4499,4512] [2022-12-13 11:18:26,685 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_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i[4559,4572] [2022-12-13 11:18:27,292 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:18:27,293 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:18:27,293 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:18:27,294 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:18:27,295 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:18:27,304 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:18:27,305 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:18:27,306 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:18:27,307 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:18:27,369 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 11:18:27,370 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 11:18:27,370 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 11:18:27,373 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-12-13 11:18:27,375 WARN L623 FunctionHandler]: Unknown extern function htons [2022-12-13 11:18:27,375 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-12-13 11:18:27,612 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-12-13 11:18:27,613 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-12-13 11:18:27,614 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-12-13 11:18:27,614 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-12-13 11:18:27,615 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-12-13 11:18:27,616 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-12-13 11:18:27,616 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-12-13 11:18:27,617 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-12-13 11:18:27,617 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-12-13 11:18:27,618 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-12-13 11:18:27,618 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-12-13 11:18:27,741 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-12-13 11:18:27,765 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-12-13 11:18:27,771 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 11:18:27,789 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 11:18:27,794 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:18:27,795 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:18:27,831 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-12-13 11:18:27,844 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 11:18:27,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:18:27,904 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:18:27,913 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_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i[4499,4512] [2022-12-13 11:18:27,914 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_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i[4559,4572] [2022-12-13 11:18:27,939 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:18:27,940 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:18:27,940 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:18:27,940 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:18:27,941 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:18:27,945 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:18:27,945 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:18:27,946 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:18:27,946 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:18:27,951 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 11:18:27,952 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 11:18:27,952 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 11:18:27,954 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-12-13 11:18:27,955 WARN L623 FunctionHandler]: Unknown extern function htons [2022-12-13 11:18:27,956 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-12-13 11:18:27,970 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-12-13 11:18:27,971 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-12-13 11:18:27,971 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-12-13 11:18:27,972 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-12-13 11:18:27,972 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-12-13 11:18:27,973 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-12-13 11:18:27,973 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-12-13 11:18:27,974 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-12-13 11:18:27,974 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-12-13 11:18:27,974 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-12-13 11:18:27,975 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-12-13 11:18:27,991 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-12-13 11:18:28,009 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-12-13 11:18:28,014 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 11:18:28,027 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 11:18:28,031 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:18:28,031 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 11:18:28,048 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-12-13 11:18:28,050 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 11:18:28,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:18:28,257 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:18:28,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:18:28 WrapperNode [2022-12-13 11:18:28,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:18:28,258 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:18:28,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:18:28,259 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:18:28,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:18:28" (1/1) ... [2022-12-13 11:18:28,334 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:18:28" (1/1) ... [2022-12-13 11:18:28,379 INFO L138 Inliner]: procedures = 690, calls = 2736, calls flagged for inlining = 58, calls inlined = 6, statements flattened = 792 [2022-12-13 11:18:28,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:18:28,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:18:28,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:18:28,380 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:18:28,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:18:28" (1/1) ... [2022-12-13 11:18:28,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:18:28" (1/1) ... [2022-12-13 11:18:28,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:18:28" (1/1) ... [2022-12-13 11:18:28,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:18:28" (1/1) ... [2022-12-13 11:18:28,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:18:28" (1/1) ... [2022-12-13 11:18:28,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:18:28" (1/1) ... [2022-12-13 11:18:28,419 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:18:28" (1/1) ... [2022-12-13 11:18:28,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:18:28" (1/1) ... [2022-12-13 11:18:28,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:18:28,428 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:18:28,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:18:28,428 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:18:28,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:18:28" (1/1) ... [2022-12-13 11:18:28,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:18:28,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:18:28,450 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:18:28,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:18:28,486 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-12-13 11:18:28,487 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-12-13 11:18:28,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:18:28,487 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-12-13 11:18:28,487 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-12-13 11:18:28,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2022-12-13 11:18:28,487 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2022-12-13 11:18:28,487 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2022-12-13 11:18:28,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-12-13 11:18:28,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-12-13 11:18:28,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 11:18:28,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-12-13 11:18:28,487 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-12-13 11:18:28,487 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-12-13 11:18:28,487 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-12-13 11:18:28,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-13 11:18:28,488 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-13 11:18:28,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 11:18:28,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:18:28,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 11:18:28,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:18:28,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:18:28,488 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-12-13 11:18:28,488 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-12-13 11:18:28,488 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2022-12-13 11:18:28,488 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2022-12-13 11:18:28,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-12-13 11:18:28,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-12-13 11:18:28,488 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2022-12-13 11:18:28,488 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2022-12-13 11:18:28,489 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 11:18:28,489 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 11:18:28,489 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2022-12-13 11:18:28,489 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2022-12-13 11:18:28,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:18:28,489 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-12-13 11:18:28,489 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-12-13 11:18:28,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 11:18:28,489 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_new_from_array [2022-12-13 11:18:28,489 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_new_from_array [2022-12-13 11:18:28,489 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-12-13 11:18:28,489 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-12-13 11:18:28,489 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-12-13 11:18:28,489 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-12-13 11:18:28,489 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-12-13 11:18:28,490 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-12-13 11:18:28,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:18:28,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2022-12-13 11:18:28,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:18:28,694 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 11:18:28,696 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:18:28,827 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !true; [2022-12-13 11:18:29,505 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 11:18:29,509 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:18:29,510 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 11:18:29,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:18:29 BoogieIcfgContainer [2022-12-13 11:18:29,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:18:29,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:18:29,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:18:29,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:18:29,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:18:26" (1/3) ... [2022-12-13 11:18:29,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ac2639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:18:29, skipping insertion in model container [2022-12-13 11:18:29,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:18:28" (2/3) ... [2022-12-13 11:18:29,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ac2639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:18:29, skipping insertion in model container [2022-12-13 11:18:29,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:18:29" (3/3) ... [2022-12-13 11:18:29,517 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_string_new_from_array_harness.i [2022-12-13 11:18:29,530 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:18:29,531 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 11:18:29,568 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:18:29,574 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@61931424, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 11:18:29,575 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 11:18:29,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 83 states have internal predecessors, (97), 33 states have call successors, (33), 16 states have call predecessors, (33), 16 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-12-13 11:18:29,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-13 11:18:29,585 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:18:29,585 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:18:29,586 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:18:29,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:18:29,589 INFO L85 PathProgramCache]: Analyzing trace with hash -2057633121, now seen corresponding path program 1 times [2022-12-13 11:18:29,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:18:29,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189899114] [2022-12-13 11:18:29,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:18:29,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:18:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:29,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:18:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:29,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 11:18:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:29,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:18:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:30,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:18:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:30,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 11:18:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:30,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:18:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:30,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:18:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:30,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 11:18:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:30,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:18:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:30,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 11:18:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:30,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:18:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:30,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:18:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:30,135 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-12-13 11:18:30,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:18:30,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189899114] [2022-12-13 11:18:30,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189899114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:18:30,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:18:30,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:18:30,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109060229] [2022-12-13 11:18:30,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:18:30,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:18:30,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:18:30,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:18:30,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:18:30,172 INFO L87 Difference]: Start difference. First operand has 133 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 83 states have internal predecessors, (97), 33 states have call successors, (33), 16 states have call predecessors, (33), 16 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 11:18:30,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:18:30,664 INFO L93 Difference]: Finished difference Result 277 states and 358 transitions. [2022-12-13 11:18:30,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:18:30,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 71 [2022-12-13 11:18:30,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:18:30,676 INFO L225 Difference]: With dead ends: 277 [2022-12-13 11:18:30,676 INFO L226 Difference]: Without dead ends: 144 [2022-12-13 11:18:30,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:18:30,682 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 60 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:18:30,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 160 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 11:18:30,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-12-13 11:18:30,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 127. [2022-12-13 11:18:30,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.1428571428571428) internal successors, (88), 78 states have internal predecessors, (88), 33 states have call successors, (33), 16 states have call predecessors, (33), 16 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-12-13 11:18:30,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 153 transitions. [2022-12-13 11:18:30,731 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 153 transitions. Word has length 71 [2022-12-13 11:18:30,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:18:30,732 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 153 transitions. [2022-12-13 11:18:30,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 11:18:30,732 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 153 transitions. [2022-12-13 11:18:30,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-13 11:18:30,735 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:18:30,735 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:18:30,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:18:30,736 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:18:30,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:18:30,736 INFO L85 PathProgramCache]: Analyzing trace with hash 866247645, now seen corresponding path program 1 times [2022-12-13 11:18:30,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:18:30,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627979230] [2022-12-13 11:18:30,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:18:30,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:18:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:31,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:18:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:31,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 11:18:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:31,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:18:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:31,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:18:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:31,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 11:18:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:31,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:18:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:31,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:18:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:31,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 11:18:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:31,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:18:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:31,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 11:18:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:31,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:18:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:31,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:18:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:31,285 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-12-13 11:18:31,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:18:31,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627979230] [2022-12-13 11:18:31,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627979230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:18:31,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:18:31,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:18:31,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451865897] [2022-12-13 11:18:31,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:18:31,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:18:31,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:18:31,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:18:31,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:18:31,289 INFO L87 Difference]: Start difference. First operand 127 states and 153 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-12-13 11:18:31,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:18:31,902 INFO L93 Difference]: Finished difference Result 188 states and 225 transitions. [2022-12-13 11:18:31,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:18:31,903 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 71 [2022-12-13 11:18:31,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:18:31,905 INFO L225 Difference]: With dead ends: 188 [2022-12-13 11:18:31,905 INFO L226 Difference]: Without dead ends: 149 [2022-12-13 11:18:31,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:18:31,906 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 62 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 11:18:31,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 314 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 11:18:31,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-12-13 11:18:31,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 132. [2022-12-13 11:18:31,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 82 states have internal predecessors, (92), 33 states have call successors, (33), 16 states have call predecessors, (33), 17 states have return successors, (33), 33 states have call predecessors, (33), 32 states have call successors, (33) [2022-12-13 11:18:31,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 158 transitions. [2022-12-13 11:18:31,927 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 158 transitions. Word has length 71 [2022-12-13 11:18:31,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:18:31,928 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 158 transitions. [2022-12-13 11:18:31,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-12-13 11:18:31,928 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 158 transitions. [2022-12-13 11:18:31,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-13 11:18:31,929 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:18:31,929 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:18:31,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:18:31,930 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:18:31,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:18:31,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1202353843, now seen corresponding path program 1 times [2022-12-13 11:18:31,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:18:31,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509067366] [2022-12-13 11:18:31,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:18:31,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:18:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:32,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:18:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:32,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 11:18:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:32,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:18:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:32,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:18:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:32,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 11:18:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:32,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:18:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:32,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:18:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:32,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 11:18:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:32,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:18:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:32,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 11:18:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:32,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:18:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:32,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:18:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:32,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 11:18:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:32,571 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-12-13 11:18:32,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:18:32,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509067366] [2022-12-13 11:18:32,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509067366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:18:32,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:18:32,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 11:18:32,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970505361] [2022-12-13 11:18:32,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:18:32,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:18:32,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:18:32,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:18:32,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:18:32,574 INFO L87 Difference]: Start difference. First operand 132 states and 158 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-12-13 11:18:33,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:18:33,175 INFO L93 Difference]: Finished difference Result 203 states and 248 transitions. [2022-12-13 11:18:33,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 11:18:33,175 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 77 [2022-12-13 11:18:33,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:18:33,177 INFO L225 Difference]: With dead ends: 203 [2022-12-13 11:18:33,177 INFO L226 Difference]: Without dead ends: 162 [2022-12-13 11:18:33,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:18:33,178 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 139 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 11:18:33,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 328 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 11:18:33,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-12-13 11:18:33,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 127. [2022-12-13 11:18:33,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 78 states have internal predecessors, (86), 33 states have call successors, (33), 16 states have call predecessors, (33), 16 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-12-13 11:18:33,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 151 transitions. [2022-12-13 11:18:33,188 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 151 transitions. Word has length 77 [2022-12-13 11:18:33,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:18:33,188 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 151 transitions. [2022-12-13 11:18:33,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-12-13 11:18:33,189 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 151 transitions. [2022-12-13 11:18:33,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-12-13 11:18:33,190 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:18:33,190 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 11:18:33,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:18:33,190 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:18:33,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:18:33,191 INFO L85 PathProgramCache]: Analyzing trace with hash 845366680, now seen corresponding path program 1 times [2022-12-13 11:18:33,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:18:33,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303988924] [2022-12-13 11:18:33,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:18:33,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:18:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:33,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:18:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:33,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 11:18:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:33,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:18:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:33,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:18:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:33,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 11:18:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:33,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:18:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:33,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:18:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:33,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 11:18:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:33,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 11:18:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:33,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 11:18:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:33,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:18:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:33,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 11:18:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:33,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:18:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:33,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:18:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:33,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:18:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:33,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:18:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:33,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 11:18:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:33,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:18:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:33,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-12-13 11:18:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:33,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-12-13 11:18:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:33,818 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-12-13 11:18:33,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:18:33,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303988924] [2022-12-13 11:18:33,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303988924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:18:33,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:18:33,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 11:18:33,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459865362] [2022-12-13 11:18:33,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:18:33,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 11:18:33,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:18:33,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 11:18:33,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:18:33,821 INFO L87 Difference]: Start difference. First operand 127 states and 151 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-12-13 11:18:34,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:18:34,663 INFO L93 Difference]: Finished difference Result 206 states and 248 transitions. [2022-12-13 11:18:34,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 11:18:34,663 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 121 [2022-12-13 11:18:34,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:18:34,664 INFO L225 Difference]: With dead ends: 206 [2022-12-13 11:18:34,664 INFO L226 Difference]: Without dead ends: 152 [2022-12-13 11:18:34,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-12-13 11:18:34,665 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 91 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 11:18:34,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 420 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 11:18:34,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-12-13 11:18:34,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 132. [2022-12-13 11:18:34,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.1111111111111112) internal successors, (90), 82 states have internal predecessors, (90), 33 states have call successors, (33), 16 states have call predecessors, (33), 17 states have return successors, (33), 33 states have call predecessors, (33), 32 states have call successors, (33) [2022-12-13 11:18:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 156 transitions. [2022-12-13 11:18:34,675 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 156 transitions. Word has length 121 [2022-12-13 11:18:34,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:18:34,675 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 156 transitions. [2022-12-13 11:18:34,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-12-13 11:18:34,675 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 156 transitions. [2022-12-13 11:18:34,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-12-13 11:18:34,677 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:18:34,677 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 11:18:34,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:18:34,677 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:18:34,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:18:34,677 INFO L85 PathProgramCache]: Analyzing trace with hash 606085033, now seen corresponding path program 1 times [2022-12-13 11:18:34,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:18:34,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209279539] [2022-12-13 11:18:34,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:18:34,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:18:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:35,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:18:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:35,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 11:18:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:35,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:18:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:35,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:18:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:35,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 11:18:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:35,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:18:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:35,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:18:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:35,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 11:18:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:35,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 11:18:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:35,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 11:18:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:35,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:18:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:35,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 11:18:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:35,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:18:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:35,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:18:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:35,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:18:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:35,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:18:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:35,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 11:18:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:35,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:18:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:35,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:18:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:35,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-12-13 11:18:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:35,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 11:18:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:35,352 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-12-13 11:18:35,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:18:35,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209279539] [2022-12-13 11:18:35,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209279539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:18:35,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:18:35,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 11:18:35,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281762913] [2022-12-13 11:18:35,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:18:35,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 11:18:35,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:18:35,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 11:18:35,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:18:35,354 INFO L87 Difference]: Start difference. First operand 132 states and 156 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2022-12-13 11:18:36,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:18:36,356 INFO L93 Difference]: Finished difference Result 212 states and 256 transitions. [2022-12-13 11:18:36,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 11:18:36,356 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) Word has length 127 [2022-12-13 11:18:36,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:18:36,359 INFO L225 Difference]: With dead ends: 212 [2022-12-13 11:18:36,359 INFO L226 Difference]: Without dead ends: 144 [2022-12-13 11:18:36,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2022-12-13 11:18:36,361 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 122 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 11:18:36,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 404 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 11:18:36,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-12-13 11:18:36,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 125. [2022-12-13 11:18:36,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 77 states have internal predecessors, (83), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-12-13 11:18:36,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 146 transitions. [2022-12-13 11:18:36,375 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 146 transitions. Word has length 127 [2022-12-13 11:18:36,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:18:36,376 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 146 transitions. [2022-12-13 11:18:36,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2022-12-13 11:18:36,376 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 146 transitions. [2022-12-13 11:18:36,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-12-13 11:18:36,378 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:18:36,379 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 11:18:36,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:18:36,379 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:18:36,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:18:36,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1368893272, now seen corresponding path program 1 times [2022-12-13 11:18:36,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:18:36,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588231589] [2022-12-13 11:18:36,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:18:36,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:18:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:39,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:18:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:39,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 11:18:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:39,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:18:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:39,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:18:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:39,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 11:18:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:39,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:18:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:39,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:18:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:39,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 11:18:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:39,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 11:18:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:39,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 11:18:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:39,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:18:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:39,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 11:18:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:40,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:18:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:40,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:18:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:40,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:18:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:40,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:18:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:40,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 11:18:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:40,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:18:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:40,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 11:18:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:40,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:18:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:40,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 11:18:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:40,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-12-13 11:18:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:40,421 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-12-13 11:18:40,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:18:40,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588231589] [2022-12-13 11:18:40,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588231589] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:18:40,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768306495] [2022-12-13 11:18:40,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:18:40,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:18:40,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:18:40,424 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:18:40,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 11:18:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:18:40,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 2748 conjuncts, 112 conjunts are in the unsatisfiable core [2022-12-13 11:18:40,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:18:41,639 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:18:41,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 82 [2022-12-13 11:18:41,790 INFO L321 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-12-13 11:18:41,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 108 [2022-12-13 11:18:41,834 INFO L321 Elim1Store]: treesize reduction 118, result has 7.1 percent of original size [2022-12-13 11:18:41,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 74 [2022-12-13 11:18:42,702 INFO L321 Elim1Store]: treesize reduction 93, result has 7.9 percent of original size [2022-12-13 11:18:42,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 191 treesize of output 122 [2022-12-13 11:18:42,838 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 12 proven. 37 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-12-13 11:18:42,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:19:34,493 WARN L233 SmtUtils]: Spent 42.64s on a formula simplification. DAG size of input: 184 DAG size of output: 93 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:19:35,252 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 144 treesize of output 132 [2022-12-13 11:19:35,257 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 44 treesize of output 37 [2022-12-13 11:19:35,262 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 144 treesize of output 132 [2022-12-13 11:19:35,273 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-13 11:19:35,273 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 265 treesize of output 232 [2022-12-13 11:19:36,163 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-12-13 11:19:36,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768306495] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:19:36,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:19:36,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 32, 19] total 68 [2022-12-13 11:19:36,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960104824] [2022-12-13 11:19:36,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:19:36,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-12-13 11:19:36,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:19:36,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-12-13 11:19:36,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=4358, Unknown=2, NotChecked=0, Total=4556 [2022-12-13 11:19:36,168 INFO L87 Difference]: Start difference. First operand 125 states and 146 transitions. Second operand has 68 states, 57 states have (on average 2.491228070175439) internal successors, (142), 48 states have internal predecessors, (142), 24 states have call successors, (55), 14 states have call predecessors, (55), 17 states have return successors, (53), 29 states have call predecessors, (53), 19 states have call successors, (53) [2022-12-13 11:19:48,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:19:48,581 INFO L93 Difference]: Finished difference Result 247 states and 297 transitions. [2022-12-13 11:19:48,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-12-13 11:19:48,582 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 57 states have (on average 2.491228070175439) internal successors, (142), 48 states have internal predecessors, (142), 24 states have call successors, (55), 14 states have call predecessors, (55), 17 states have return successors, (53), 29 states have call predecessors, (53), 19 states have call successors, (53) Word has length 132 [2022-12-13 11:19:48,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:19:48,583 INFO L225 Difference]: With dead ends: 247 [2022-12-13 11:19:48,583 INFO L226 Difference]: Without dead ends: 201 [2022-12-13 11:19:48,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 261 SyntacticMatches, 6 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3020 ImplicationChecksByTransitivity, 55.4s TimeCoverageRelationStatistics Valid=790, Invalid=13011, Unknown=5, NotChecked=0, Total=13806 [2022-12-13 11:19:48,586 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 350 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 6143 mSolverCounterSat, 286 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 6450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 6143 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-12-13 11:19:48,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1948 Invalid, 6450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 6143 Invalid, 21 Unknown, 0 Unchecked, 8.5s Time] [2022-12-13 11:19:48,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-12-13 11:19:48,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 187. [2022-12-13 11:19:48,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 116 states have (on average 1.103448275862069) internal successors, (128), 120 states have internal predecessors, (128), 45 states have call successors, (45), 21 states have call predecessors, (45), 25 states have return successors, (48), 45 states have call predecessors, (48), 43 states have call successors, (48) [2022-12-13 11:19:48,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 221 transitions. [2022-12-13 11:19:48,600 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 221 transitions. Word has length 132 [2022-12-13 11:19:48,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:19:48,601 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 221 transitions. [2022-12-13 11:19:48,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 57 states have (on average 2.491228070175439) internal successors, (142), 48 states have internal predecessors, (142), 24 states have call successors, (55), 14 states have call predecessors, (55), 17 states have return successors, (53), 29 states have call predecessors, (53), 19 states have call successors, (53) [2022-12-13 11:19:48,601 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 221 transitions. [2022-12-13 11:19:48,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-13 11:19:48,602 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:19:48,602 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 11:19:48,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 11:19:48,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 11:19:48,804 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:19:48,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:19:48,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1120489894, now seen corresponding path program 1 times [2022-12-13 11:19:48,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:19:48,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133802891] [2022-12-13 11:19:48,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:19:48,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:19:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:49,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:19:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:49,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 11:19:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:49,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:19:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:49,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:49,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 11:19:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:49,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:19:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:49,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:19:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:49,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 11:19:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:49,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 11:19:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:49,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 11:19:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:49,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:49,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 11:19:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:49,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 11:19:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:49,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:49,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:49,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:19:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:49,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:19:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:49,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 11:19:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:49,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:49,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 11:19:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:49,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:49,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-12-13 11:19:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:49,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-12-13 11:19:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:49,610 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-12-13 11:19:49,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:19:49,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133802891] [2022-12-13 11:19:49,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133802891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:19:49,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:19:49,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-13 11:19:49,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310267996] [2022-12-13 11:19:49,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:19:49,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 11:19:49,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:19:49,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 11:19:49,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-12-13 11:19:49,613 INFO L87 Difference]: Start difference. First operand 187 states and 221 transitions. Second operand has 20 states, 20 states have (on average 3.2) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (24), 7 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 2 states have call successors, (22) [2022-12-13 11:19:51,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:19:51,320 INFO L93 Difference]: Finished difference Result 288 states and 344 transitions. [2022-12-13 11:19:51,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 11:19:51,321 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.2) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (24), 7 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 2 states have call successors, (22) Word has length 138 [2022-12-13 11:19:51,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:19:51,322 INFO L225 Difference]: With dead ends: 288 [2022-12-13 11:19:51,322 INFO L226 Difference]: Without dead ends: 205 [2022-12-13 11:19:51,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=1163, Unknown=0, NotChecked=0, Total=1332 [2022-12-13 11:19:51,323 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 115 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:19:51,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 898 Invalid, 1809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-13 11:19:51,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-12-13 11:19:51,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 197. [2022-12-13 11:19:51,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 124 states have (on average 1.1129032258064515) internal successors, (138), 130 states have internal predecessors, (138), 45 states have call successors, (45), 21 states have call predecessors, (45), 27 states have return successors, (50), 45 states have call predecessors, (50), 43 states have call successors, (50) [2022-12-13 11:19:51,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 233 transitions. [2022-12-13 11:19:51,337 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 233 transitions. Word has length 138 [2022-12-13 11:19:51,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:19:51,337 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 233 transitions. [2022-12-13 11:19:51,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.2) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (24), 7 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 2 states have call successors, (22) [2022-12-13 11:19:51,338 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 233 transitions. [2022-12-13 11:19:51,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-13 11:19:51,339 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:19:51,339 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 11:19:51,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:19:51,339 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:19:51,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:19:51,339 INFO L85 PathProgramCache]: Analyzing trace with hash 727462884, now seen corresponding path program 1 times [2022-12-13 11:19:51,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:19:51,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34431039] [2022-12-13 11:19:51,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:19:51,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:19:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:51,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:19:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:51,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 11:19:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:51,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:19:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:51,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:51,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 11:19:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:51,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:19:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:51,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:19:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:51,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 11:19:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:51,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 11:19:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:51,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 11:19:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:51,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:51,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 11:19:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:51,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 11:19:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:51,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:51,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:51,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:19:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:51,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:19:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:51,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 11:19:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:51,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:51,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 11:19:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:51,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:51,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-12-13 11:19:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:51,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-12-13 11:19:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-12-13 11:19:51,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:19:51,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34431039] [2022-12-13 11:19:51,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34431039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:19:51,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:19:51,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-12-13 11:19:51,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661450114] [2022-12-13 11:19:51,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:19:51,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 11:19:51,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:19:51,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 11:19:51,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-12-13 11:19:51,944 INFO L87 Difference]: Start difference. First operand 197 states and 233 transitions. Second operand has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 10 states have internal predecessors, (64), 3 states have call successors, (24), 7 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 2 states have call successors, (22) [2022-12-13 11:19:53,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:19:53,345 INFO L93 Difference]: Finished difference Result 306 states and 363 transitions. [2022-12-13 11:19:53,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 11:19:53,345 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 10 states have internal predecessors, (64), 3 states have call successors, (24), 7 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 2 states have call successors, (22) Word has length 138 [2022-12-13 11:19:53,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:19:53,347 INFO L225 Difference]: With dead ends: 306 [2022-12-13 11:19:53,347 INFO L226 Difference]: Without dead ends: 208 [2022-12-13 11:19:53,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=922, Unknown=0, NotChecked=0, Total=1056 [2022-12-13 11:19:53,349 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 182 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:19:53,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 689 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1351 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-13 11:19:53,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-12-13 11:19:53,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 193. [2022-12-13 11:19:53,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 122 states have (on average 1.1147540983606556) internal successors, (136), 127 states have internal predecessors, (136), 44 states have call successors, (44), 21 states have call predecessors, (44), 26 states have return successors, (47), 44 states have call predecessors, (47), 42 states have call successors, (47) [2022-12-13 11:19:53,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 227 transitions. [2022-12-13 11:19:53,363 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 227 transitions. Word has length 138 [2022-12-13 11:19:53,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:19:53,363 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 227 transitions. [2022-12-13 11:19:53,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 10 states have internal predecessors, (64), 3 states have call successors, (24), 7 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 2 states have call successors, (22) [2022-12-13 11:19:53,364 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 227 transitions. [2022-12-13 11:19:53,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-12-13 11:19:53,364 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:19:53,365 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 11:19:53,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:19:53,365 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:19:53,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:19:53,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1108978750, now seen corresponding path program 1 times [2022-12-13 11:19:53,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:19:53,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316402094] [2022-12-13 11:19:53,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:19:53,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:19:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:53,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:19:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:53,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 11:19:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:53,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:19:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:53,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:53,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 11:19:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:53,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:19:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:53,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:19:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:53,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 11:19:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:53,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 11:19:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:53,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 11:19:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:53,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:53,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 11:19:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:53,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:53,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:53,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:19:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:53,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:19:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:53,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 11:19:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:53,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:53,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 11:19:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:53,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:53,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 11:19:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:53,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-12-13 11:19:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:53,835 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-12-13 11:19:53,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:19:53,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316402094] [2022-12-13 11:19:53,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316402094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:19:53,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:19:53,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 11:19:53,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639653573] [2022-12-13 11:19:53,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:19:53,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:19:53,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:19:53,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:19:53,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:19:53,837 INFO L87 Difference]: Start difference. First operand 193 states and 227 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-12-13 11:19:54,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:19:54,579 INFO L93 Difference]: Finished difference Result 244 states and 289 transitions. [2022-12-13 11:19:54,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:19:54,580 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 133 [2022-12-13 11:19:54,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:19:54,581 INFO L225 Difference]: With dead ends: 244 [2022-12-13 11:19:54,581 INFO L226 Difference]: Without dead ends: 194 [2022-12-13 11:19:54,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:19:54,582 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 82 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 11:19:54,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 201 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 11:19:54,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-12-13 11:19:54,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2022-12-13 11:19:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 123 states have (on average 1.113821138211382) internal successors, (137), 128 states have internal predecessors, (137), 44 states have call successors, (44), 21 states have call predecessors, (44), 26 states have return successors, (47), 44 states have call predecessors, (47), 42 states have call successors, (47) [2022-12-13 11:19:54,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 228 transitions. [2022-12-13 11:19:54,605 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 228 transitions. Word has length 133 [2022-12-13 11:19:54,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:19:54,605 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 228 transitions. [2022-12-13 11:19:54,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-12-13 11:19:54,605 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 228 transitions. [2022-12-13 11:19:54,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-12-13 11:19:54,606 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:19:54,606 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 11:19:54,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:19:54,607 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:19:54,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:19:54,607 INFO L85 PathProgramCache]: Analyzing trace with hash 706076010, now seen corresponding path program 1 times [2022-12-13 11:19:54,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:19:54,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14679748] [2022-12-13 11:19:54,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:19:54,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:19:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:54,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:19:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:54,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 11:19:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:54,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:19:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:54,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:54,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 11:19:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:54,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:19:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:54,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:19:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:54,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 11:19:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:54,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 11:19:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:54,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 11:19:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:54,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:54,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 11:19:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:54,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-12-13 11:19:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:54,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:54,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:54,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:19:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:54,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:19:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:54,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 11:19:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:54,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:54,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 11:19:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:54,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:54,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-12-13 11:19:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:54,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-12-13 11:19:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:54,972 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-12-13 11:19:54,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:19:54,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14679748] [2022-12-13 11:19:54,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14679748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:19:54,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:19:54,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 11:19:54,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438571792] [2022-12-13 11:19:54,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:19:54,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 11:19:54,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:19:54,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 11:19:54,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-13 11:19:54,974 INFO L87 Difference]: Start difference. First operand 194 states and 228 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2022-12-13 11:19:55,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:19:55,851 INFO L93 Difference]: Finished difference Result 287 states and 333 transitions. [2022-12-13 11:19:55,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 11:19:55,851 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) Word has length 140 [2022-12-13 11:19:55,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:19:55,852 INFO L225 Difference]: With dead ends: 287 [2022-12-13 11:19:55,852 INFO L226 Difference]: Without dead ends: 126 [2022-12-13 11:19:55,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-12-13 11:19:55,853 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 105 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 11:19:55,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 407 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 11:19:55,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-12-13 11:19:55,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-12-13 11:19:55,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 78 states have (on average 1.0897435897435896) internal successors, (85), 80 states have internal predecessors, (85), 31 states have call successors, (31), 15 states have call predecessors, (31), 16 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-12-13 11:19:55,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 147 transitions. [2022-12-13 11:19:55,861 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 147 transitions. Word has length 140 [2022-12-13 11:19:55,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:19:55,861 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 147 transitions. [2022-12-13 11:19:55,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2022-12-13 11:19:55,861 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 147 transitions. [2022-12-13 11:19:55,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-12-13 11:19:55,862 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:19:55,862 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 11:19:55,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:19:55,862 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:19:55,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:19:55,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1489473318, now seen corresponding path program 1 times [2022-12-13 11:19:55,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:19:55,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032889063] [2022-12-13 11:19:55,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:19:55,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:19:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:57,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:19:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:57,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 11:19:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:57,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:19:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:57,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:57,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 11:19:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:57,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:19:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:57,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:19:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:57,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 11:19:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:57,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 11:19:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:57,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 11:19:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:57,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:57,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 11:19:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:57,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:57,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:57,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:19:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:57,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:19:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:57,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 11:19:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:57,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:57,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 11:19:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:57,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:19:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:57,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 11:19:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:58,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 11:19:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-12-13 11:19:58,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:19:58,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032889063] [2022-12-13 11:19:58,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032889063] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:19:58,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336654199] [2022-12-13 11:19:58,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:19:58,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:19:58,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:19:58,063 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:19:58,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 11:19:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:19:58,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 2899 conjuncts, 128 conjunts are in the unsatisfiable core [2022-12-13 11:19:58,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:20:03,979 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:20:04,175 WARN L859 $PredicateComparison]: unable to prove that (exists ((|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_9_66| Int) (v_ArrVal_1022 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_9_66| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_9_66|))) (and (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_9_66|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_9_66| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_9_66|)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_9_66| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1022)) |c_#memory_int|)))) is different from true [2022-12-13 11:20:04,306 WARN L859 $PredicateComparison]: unable to prove that (exists ((|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_9_66| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1326_9| Int) (v_ArrVal_1022 Int) (v_ArrVal_1024 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_9_66| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_9_66|))) (and (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_9_66|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1326_9|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_9_66| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_9_66| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1022) (+ |v_#Ultimate.C_memcpy_#t~loopctr1326_9| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1024)) |c_#memory_int|) (<= 0 (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_9_66|))))) is different from true [2022-12-13 11:20:04,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:20:04,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:20:04,369 INFO L321 Elim1Store]: treesize reduction 22, result has 47.6 percent of original size [2022-12-13 11:20:04,370 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 1 case distinctions, treesize of input 31 treesize of output 42 [2022-12-13 11:20:04,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 82 [2022-12-13 11:20:04,542 INFO L321 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-12-13 11:20:04,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 108 [2022-12-13 11:20:18,520 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:20:18,521 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 347 treesize of output 303 [2022-12-13 11:20:18,726 INFO L321 Elim1Store]: treesize reduction 106, result has 35.8 percent of original size [2022-12-13 11:20:18,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 1009 treesize of output 955 [2022-12-13 11:20:19,216 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 12 proven. 37 refuted. 0 times theorem prover too weak. 74 trivial. 2 not checked. [2022-12-13 11:20:19,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:20:43,083 WARN L233 SmtUtils]: Spent 10.73s on a formula simplification. DAG size of input: 130 DAG size of output: 93 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:20:43,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336654199] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:20:43,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:20:43,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 37] total 55 [2022-12-13 11:20:43,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151240880] [2022-12-13 11:20:43,086 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:20:43,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-12-13 11:20:43,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:20:43,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-12-13 11:20:43,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=3617, Unknown=14, NotChecked=242, Total=4032 [2022-12-13 11:20:43,088 INFO L87 Difference]: Start difference. First operand 126 states and 147 transitions. Second operand has 55 states, 48 states have (on average 2.375) internal successors, (114), 39 states have internal predecessors, (114), 15 states have call successors, (43), 10 states have call predecessors, (43), 14 states have return successors, (40), 21 states have call predecessors, (40), 13 states have call successors, (40) [2022-12-13 11:20:46,195 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-13 11:20:48,252 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-13 11:20:50,544 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-13 11:20:54,716 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-13 11:20:56,776 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-13 11:20:59,050 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-13 11:21:01,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:21:03,234 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-13 11:21:07,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:21:14,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:21:19,859 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-13 11:21:24,577 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-13 11:21:39,098 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-13 11:21:45,287 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-13 11:21:47,970 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-13 11:21:52,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:21:58,815 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-13 11:22:00,894 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-13 11:22:05,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:22:07,582 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-13 11:22:09,641 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-13 11:22:12,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:22:14,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:22:16,635 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-13 11:22:18,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:22:20,845 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-13 11:22:23,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:22:25,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:22:27,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:22:30,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:22:32,296 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-13 11:22:34,350 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-13 11:22:36,407 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-13 11:22:38,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:22:38,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:22:38,428 INFO L93 Difference]: Finished difference Result 184 states and 217 transitions. [2022-12-13 11:22:38,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-13 11:22:38,440 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 48 states have (on average 2.375) internal successors, (114), 39 states have internal predecessors, (114), 15 states have call successors, (43), 10 states have call predecessors, (43), 14 states have return successors, (40), 21 states have call predecessors, (40), 13 states have call successors, (40) Word has length 134 [2022-12-13 11:22:38,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:22:38,440 INFO L225 Difference]: With dead ends: 184 [2022-12-13 11:22:38,440 INFO L226 Difference]: Without dead ends: 129 [2022-12-13 11:22:38,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 75.9s TimeCoverageRelationStatistics Valid=418, Invalid=8310, Unknown=22, NotChecked=370, Total=9120 [2022-12-13 11:22:38,442 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 153 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 4792 mSolverCounterSat, 85 mSolverCounterUnsat, 43 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 80.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 5208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 4792 IncrementalHoareTripleChecker+Invalid, 43 IncrementalHoareTripleChecker+Unknown, 288 IncrementalHoareTripleChecker+Unchecked, 81.6s IncrementalHoareTripleChecker+Time [2022-12-13 11:22:38,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1360 Invalid, 5208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 4792 Invalid, 43 Unknown, 288 Unchecked, 81.6s Time] [2022-12-13 11:22:38,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-12-13 11:22:38,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2022-12-13 11:22:38,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 79 states have (on average 1.0886075949367089) internal successors, (86), 81 states have internal predecessors, (86), 31 states have call successors, (31), 15 states have call predecessors, (31), 16 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-12-13 11:22:38,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 148 transitions. [2022-12-13 11:22:38,452 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 148 transitions. Word has length 134 [2022-12-13 11:22:38,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:22:38,452 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 148 transitions. [2022-12-13 11:22:38,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 48 states have (on average 2.375) internal successors, (114), 39 states have internal predecessors, (114), 15 states have call successors, (43), 10 states have call predecessors, (43), 14 states have return successors, (40), 21 states have call predecessors, (40), 13 states have call successors, (40) [2022-12-13 11:22:38,453 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 148 transitions. [2022-12-13 11:22:38,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-13 11:22:38,453 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:22:38,453 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 11:22:38,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 11:22:38,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 11:22:38,655 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:22:38,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:22:38,656 INFO L85 PathProgramCache]: Analyzing trace with hash 982362820, now seen corresponding path program 2 times [2022-12-13 11:22:38,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:22:38,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251374920] [2022-12-13 11:22:38,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:22:38,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:22:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:40,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:22:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:40,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 11:22:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:40,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:22:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:40,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:22:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:40,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 11:22:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:40,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:22:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:40,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:22:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:41,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 11:22:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:41,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 11:22:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:41,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 11:22:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:41,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:22:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:41,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 11:22:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:41,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:22:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:41,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:22:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:41,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:22:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:41,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:22:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:41,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 11:22:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:41,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:22:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:41,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 11:22:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:41,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:22:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:41,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 11:22:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:41,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-12-13 11:22:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:41,832 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 21 proven. 27 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-12-13 11:22:41,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:22:41,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251374920] [2022-12-13 11:22:41,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251374920] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:22:41,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422809420] [2022-12-13 11:22:41,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 11:22:41,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:22:41,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:22:41,834 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:22:41,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 11:22:42,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 11:22:42,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:22:42,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 3027 conjuncts, 136 conjunts are in the unsatisfiable core [2022-12-13 11:22:42,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:22:43,482 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:22:43,642 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1317_16| Int) (v_ArrVal_1498 Int)) (and (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1317_16|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_16| 1) |c_#Ultimate.C_memcpy_#t~loopctr1317|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_16| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1498)) |c_#memory_int|))) is different from true [2022-12-13 11:22:43,654 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1317_16| Int) (v_ArrVal_1498 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_17| Int) (v_ArrVal_1505 Int)) (and (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1317_16|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_16| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_17|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_16| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1498) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_17| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1505)) |c_#memory_int|))) is different from true [2022-12-13 11:22:43,792 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1509 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_16| Int) (v_ArrVal_1498 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1326_16| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_17| Int) (v_ArrVal_1505 Int)) (and (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1317_16|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_16| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_17|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_16| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1498) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_17| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1505) (+ |v_#Ultimate.C_memcpy_#t~loopctr1326_16| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1509)) |c_#memory_int|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1326_16|))) is different from true [2022-12-13 11:22:43,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:22:43,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:22:43,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:22:43,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:22:43,867 INFO L321 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-12-13 11:22:43,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 48 [2022-12-13 11:22:43,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 82 [2022-12-13 11:22:43,912 INFO L321 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-12-13 11:22:43,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 108 [2022-12-13 11:22:43,923 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 64 treesize of output 3 [2022-12-13 11:22:45,024 INFO L321 Elim1Store]: treesize reduction 93, result has 7.9 percent of original size [2022-12-13 11:22:45,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 204 treesize of output 127 [2022-12-13 11:22:45,240 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 9 proven. 80 refuted. 0 times theorem prover too weak. 34 trivial. 4 not checked. [2022-12-13 11:22:45,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:22:59,690 WARN L233 SmtUtils]: Spent 9.17s on a formula simplification. DAG size of input: 133 DAG size of output: 113 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:22:59,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422809420] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:22:59,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:22:59,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 41] total 65 [2022-12-13 11:22:59,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506485972] [2022-12-13 11:22:59,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:22:59,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-12-13 11:22:59,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:22:59,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-12-13 11:22:59,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=4786, Unknown=3, NotChecked=420, Total=5402 [2022-12-13 11:22:59,695 INFO L87 Difference]: Start difference. First operand 127 states and 148 transitions. Second operand has 65 states, 57 states have (on average 2.192982456140351) internal successors, (125), 48 states have internal predecessors, (125), 20 states have call successors, (45), 12 states have call predecessors, (45), 17 states have return successors, (41), 24 states have call predecessors, (41), 17 states have call successors, (41) [2022-12-13 11:23:14,209 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-13 11:23:17,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:23:17,990 INFO L93 Difference]: Finished difference Result 185 states and 218 transitions. [2022-12-13 11:23:17,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-13 11:23:17,991 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 57 states have (on average 2.192982456140351) internal successors, (125), 48 states have internal predecessors, (125), 20 states have call successors, (45), 12 states have call predecessors, (45), 17 states have return successors, (41), 24 states have call predecessors, (41), 17 states have call successors, (41) Word has length 135 [2022-12-13 11:23:17,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:23:17,992 INFO L225 Difference]: With dead ends: 185 [2022-12-13 11:23:17,992 INFO L226 Difference]: Without dead ends: 130 [2022-12-13 11:23:17,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2694 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=600, Invalid=11396, Unknown=6, NotChecked=654, Total=12656 [2022-12-13 11:23:17,994 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 310 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 5076 mSolverCounterSat, 218 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 5734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 5076 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 433 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:23:17,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1357 Invalid, 5734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 5076 Invalid, 7 Unknown, 433 Unchecked, 13.3s Time] [2022-12-13 11:23:17,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-12-13 11:23:18,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2022-12-13 11:23:18,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 80 states have (on average 1.0875) internal successors, (87), 82 states have internal predecessors, (87), 31 states have call successors, (31), 15 states have call predecessors, (31), 16 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-12-13 11:23:18,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 149 transitions. [2022-12-13 11:23:18,014 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 149 transitions. Word has length 135 [2022-12-13 11:23:18,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:23:18,014 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 149 transitions. [2022-12-13 11:23:18,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 57 states have (on average 2.192982456140351) internal successors, (125), 48 states have internal predecessors, (125), 20 states have call successors, (45), 12 states have call predecessors, (45), 17 states have return successors, (41), 24 states have call predecessors, (41), 17 states have call successors, (41) [2022-12-13 11:23:18,014 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 149 transitions. [2022-12-13 11:23:18,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-12-13 11:23:18,015 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:23:18,015 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 11:23:18,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 11:23:18,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:23:18,216 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:23:18,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:23:18,217 INFO L85 PathProgramCache]: Analyzing trace with hash 299871770, now seen corresponding path program 3 times [2022-12-13 11:23:18,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:23:18,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992936563] [2022-12-13 11:23:18,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:23:18,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:23:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:19,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:23:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:19,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 11:23:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:19,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:23:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:19,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:23:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:19,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 11:23:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:19,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:23:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:19,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:23:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:19,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 11:23:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:19,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 11:23:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:19,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 11:23:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:20,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:23:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:20,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 11:23:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:20,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:23:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:20,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:23:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:20,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:23:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:20,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:23:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:20,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 11:23:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:20,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:23:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:20,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 11:23:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:20,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:23:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:20,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 11:23:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:20,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-12-13 11:23:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:20,654 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-12-13 11:23:20,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:23:20,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992936563] [2022-12-13 11:23:20,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992936563] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:23:20,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756582213] [2022-12-13 11:23:20,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 11:23:20,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:23:20,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:23:20,655 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:23:20,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 11:23:22,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 11:23:22,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:23:22,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 2925 conjuncts, 100 conjunts are in the unsatisfiable core [2022-12-13 11:23:22,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:23:22,907 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:23:23,076 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (exists ((v_ArrVal_2164 Int) (v_ArrVal_2167 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_28| Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_2164) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_28| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2167))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_28| 1) |c_#Ultimate.C_memcpy_#t~loopctr1317|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1317_28|)))) is different from true [2022-12-13 11:23:23,091 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (exists ((v_ArrVal_2173 Int) (v_ArrVal_2164 Int) (v_ArrVal_2167 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_28| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_29| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_28| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_29|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_2164) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_28| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2167) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_29| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2173))) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1317_28|)))) is different from true [2022-12-13 11:23:23,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:23,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:23,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:23,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:23,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:23:23,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-12-13 11:23:23,529 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 11:23:23,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 36 [2022-12-13 11:23:24,353 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-12-13 11:23:24,353 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 71 [2022-12-13 11:23:24,513 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 121 trivial. 5 not checked. [2022-12-13 11:23:24,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:23:28,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756582213] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:23:28,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:23:28,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 29] total 52 [2022-12-13 11:23:28,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201067123] [2022-12-13 11:23:28,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:23:28,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-12-13 11:23:28,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:23:28,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-12-13 11:23:28,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=3278, Unknown=4, NotChecked=230, Total=3660 [2022-12-13 11:23:28,269 INFO L87 Difference]: Start difference. First operand 128 states and 149 transitions. Second operand has 52 states, 47 states have (on average 2.297872340425532) internal successors, (108), 39 states have internal predecessors, (108), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-12-13 11:23:50,322 WARN L233 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 57 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:23:52,532 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-13 11:23:56,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:23:56,211 INFO L93 Difference]: Finished difference Result 184 states and 217 transitions. [2022-12-13 11:23:56,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-13 11:23:56,212 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 2.297872340425532) internal successors, (108), 39 states have internal predecessors, (108), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) Word has length 136 [2022-12-13 11:23:56,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:23:56,213 INFO L225 Difference]: With dead ends: 184 [2022-12-13 11:23:56,213 INFO L226 Difference]: Without dead ends: 129 [2022-12-13 11:23:56,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=348, Invalid=6966, Unknown=4, NotChecked=338, Total=7656 [2022-12-13 11:23:56,216 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 104 mSDsluCounter, 1570 mSDsCounter, 0 mSdLazyCounter, 4477 mSolverCounterSat, 54 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 4824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 4477 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 285 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2022-12-13 11:23:56,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1628 Invalid, 4824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 4477 Invalid, 8 Unknown, 285 Unchecked, 15.7s Time] [2022-12-13 11:23:56,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-12-13 11:23:56,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-12-13 11:23:56,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 83 states have internal predecessors, (88), 31 states have call successors, (31), 15 states have call predecessors, (31), 16 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-12-13 11:23:56,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2022-12-13 11:23:56,230 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 136 [2022-12-13 11:23:56,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:23:56,230 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2022-12-13 11:23:56,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 2.297872340425532) internal successors, (108), 39 states have internal predecessors, (108), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-12-13 11:23:56,230 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2022-12-13 11:23:56,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-13 11:23:56,231 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:23:56,231 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 11:23:56,241 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 11:23:56,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 11:23:56,433 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:23:56,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:23:56,434 INFO L85 PathProgramCache]: Analyzing trace with hash 617485700, now seen corresponding path program 4 times [2022-12-13 11:23:56,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:23:56,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083079604] [2022-12-13 11:23:56,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:23:56,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:23:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:59,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:23:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:59,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 11:23:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:59,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:23:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:59,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:23:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:59,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 11:23:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:59,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:23:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:59,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:23:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:59,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 11:23:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:59,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 11:23:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:59,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 11:23:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:59,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:23:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:59,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 11:23:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:59,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:23:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:59,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:23:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:59,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:23:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:59,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:23:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:59,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 11:23:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:59,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:23:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:59,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 11:23:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:59,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:23:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:23:59,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 11:23:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:00,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-12-13 11:24:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:24:00,124 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 21 proven. 34 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-12-13 11:24:00,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:24:00,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083079604] [2022-12-13 11:24:00,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083079604] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:24:00,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150573932] [2022-12-13 11:24:00,124 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 11:24:00,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:24:00,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:24:00,125 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:24:00,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 11:24:00,626 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 11:24:00,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:24:00,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 3283 conjuncts, 131 conjunts are in the unsatisfiable core [2022-12-13 11:24:00,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:24:01,424 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:24:01,602 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3008 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67|))) (and (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| .cse0 1) |c_#Ultimate.C_memcpy_#t~loopctr1317|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67|) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| .cse0)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_3008)))))) is different from true [2022-12-13 11:24:01,627 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1317_41| Int) (v_ArrVal_3008 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| Int) (v_ArrVal_3013 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67|))) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_3008) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_41| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3013)) |c_#memory_int|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_41| 1) |c_#Ultimate.C_memcpy_#t~loopctr1317|) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| .cse0)) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_41|)))) is different from true [2022-12-13 11:24:01,665 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1317_41| Int) (v_ArrVal_3008 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_42| Int) (v_ArrVal_3013 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| Int) (v_ArrVal_3020 Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67|))) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_41| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_42|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_3008) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_41| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3013) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_42| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3020)) |c_#memory_int|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67|) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| .cse0)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_42| 1) |c_#Ultimate.C_memcpy_#t~loopctr1317|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_41|)))) is different from true [2022-12-13 11:24:01,705 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1317_41| Int) (v_ArrVal_3008 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_42| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_43| Int) (v_ArrVal_3023 Int) (v_ArrVal_3013 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| Int) (v_ArrVal_3020 Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67|))) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_41| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_42|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_3008) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_41| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3013) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_42| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3020) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_43| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3023)) |c_#memory_int|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67|) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| .cse0)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_42| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_43|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_41|)))) is different from true [2022-12-13 11:24:01,952 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1317_41| Int) (v_ArrVal_3008 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_42| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_43| Int) (v_ArrVal_3028 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1326_28| Int) (v_ArrVal_3023 Int) (v_ArrVal_3013 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| Int) (v_ArrVal_3020 Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67|))) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_41| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_42|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1326_28|) (<= 0 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| .cse0)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_3008) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_41| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3013) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_42| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3020) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_43| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3023) (+ |v_#Ultimate.C_memcpy_#t~loopctr1326_28| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3028))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_42| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_43|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_40_67| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_41|)))) is different from true [2022-12-13 11:24:02,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:24:02,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:24:02,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:24:02,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:24:02,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:24:02,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:24:02,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:24:02,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:24:02,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:24:02,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:24:02,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:24:02,145 INFO L321 Elim1Store]: treesize reduction 63, result has 48.8 percent of original size [2022-12-13 11:24:02,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 81 [2022-12-13 11:24:02,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 91 [2022-12-13 11:24:02,294 INFO L321 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-12-13 11:24:02,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 113 [2022-12-13 11:24:02,305 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-13 11:24:03,866 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:24:03,867 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 392 treesize of output 338 [2022-12-13 11:24:04,087 INFO L321 Elim1Store]: treesize reduction 106, result has 35.8 percent of original size [2022-12-13 11:24:04,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 1500 treesize of output 1384 [2022-12-13 11:24:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 12 proven. 37 refuted. 0 times theorem prover too weak. 74 trivial. 11 not checked. [2022-12-13 11:24:04,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:24:52,918 WARN L233 SmtUtils]: Spent 18.48s on a formula simplification. DAG size of input: 176 DAG size of output: 148 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:24:52,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150573932] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:24:52,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:24:52,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 40] total 64 [2022-12-13 11:24:52,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852088087] [2022-12-13 11:24:52,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:24:52,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-12-13 11:24:52,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:24:52,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-12-13 11:24:52,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=4380, Unknown=12, NotChecked=680, Total=5256 [2022-12-13 11:24:52,924 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand has 64 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 46 states have internal predecessors, (116), 17 states have call successors, (43), 11 states have call predecessors, (43), 14 states have return successors, (40), 23 states have call predecessors, (40), 14 states have call successors, (40) [2022-12-13 11:25:12,051 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-13 11:25:15,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:25:15,912 INFO L93 Difference]: Finished difference Result 187 states and 220 transitions. [2022-12-13 11:25:15,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-13 11:25:15,913 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 46 states have internal predecessors, (116), 17 states have call successors, (43), 11 states have call predecessors, (43), 14 states have return successors, (40), 23 states have call predecessors, (40), 14 states have call successors, (40) Word has length 137 [2022-12-13 11:25:15,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:25:15,914 INFO L225 Difference]: With dead ends: 187 [2022-12-13 11:25:15,914 INFO L226 Difference]: Without dead ends: 132 [2022-12-13 11:25:15,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 145 SyntacticMatches, 4 SemanticMatches, 106 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2110 ImplicationChecksByTransitivity, 52.3s TimeCoverageRelationStatistics Valid=468, Invalid=10045, Unknown=13, NotChecked=1030, Total=11556 [2022-12-13 11:25:15,915 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 225 mSDsluCounter, 1309 mSDsCounter, 0 mSdLazyCounter, 4849 mSolverCounterSat, 168 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 5764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 4849 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 743 IncrementalHoareTripleChecker+Unchecked, 17.6s IncrementalHoareTripleChecker+Time [2022-12-13 11:25:15,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 1363 Invalid, 5764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 4849 Invalid, 4 Unknown, 743 Unchecked, 17.6s Time] [2022-12-13 11:25:15,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-12-13 11:25:15,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2022-12-13 11:25:15,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 82 states have (on average 1.0853658536585367) internal successors, (89), 84 states have internal predecessors, (89), 31 states have call successors, (31), 15 states have call predecessors, (31), 16 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-12-13 11:25:15,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 151 transitions. [2022-12-13 11:25:15,935 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 151 transitions. Word has length 137 [2022-12-13 11:25:15,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:25:15,936 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 151 transitions. [2022-12-13 11:25:15,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 46 states have internal predecessors, (116), 17 states have call successors, (43), 11 states have call predecessors, (43), 14 states have return successors, (40), 23 states have call predecessors, (40), 14 states have call successors, (40) [2022-12-13 11:25:15,936 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 151 transitions. [2022-12-13 11:25:15,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-13 11:25:15,936 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:25:15,936 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 11:25:15,945 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 11:25:16,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:25:16,138 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:25:16,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:25:16,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1873582938, now seen corresponding path program 5 times [2022-12-13 11:25:16,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:25:16,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186541088] [2022-12-13 11:25:16,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:25:16,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:25:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:18,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:25:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:18,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 11:25:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:18,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:25:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:18,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:25:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:18,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 11:25:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:18,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:25:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:18,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:25:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:18,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 11:25:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:18,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 11:25:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:18,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 11:25:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:18,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:25:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:18,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 11:25:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:18,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:25:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:18,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:25:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:18,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:25:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:18,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:25:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:18,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 11:25:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:18,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:25:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:18,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 11:25:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:18,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:25:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:18,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 11:25:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:19,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-12-13 11:25:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:19,284 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-12-13 11:25:19,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:25:19,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186541088] [2022-12-13 11:25:19,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186541088] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:25:19,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563738511] [2022-12-13 11:25:19,284 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 11:25:19,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:25:19,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:25:19,285 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:25:19,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 11:25:38,774 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-12-13 11:25:38,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:25:38,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 3411 conjuncts, 191 conjunts are in the unsatisfiable core [2022-12-13 11:25:38,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:25:40,509 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:25:40,957 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4040 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_61| Int) (v_ArrVal_4042 Int) (v_ArrVal_4032 Int)) (and (<= 2 |v_#Ultimate.C_memcpy_#t~loopctr1317_61|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_61| 1) |c_#Ultimate.C_memcpy_#t~loopctr1317|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_4032) (+ |c_#Ultimate.C_memcpy_dest.offset| 1) v_ArrVal_4040) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_61| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4042)) |c_#memory_int|))) is different from true [2022-12-13 11:25:40,976 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4040 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_62| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_61| Int) (v_ArrVal_4050 Int) (v_ArrVal_4042 Int) (v_ArrVal_4032 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_62| 1) |c_#Ultimate.C_memcpy_#t~loopctr1317|) (<= 2 |v_#Ultimate.C_memcpy_#t~loopctr1317_61|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_61| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_62|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_4032) (+ |c_#Ultimate.C_memcpy_dest.offset| 1) v_ArrVal_4040) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_61| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4042) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_62| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4050)) |c_#memory_int|))) is different from true [2022-12-13 11:25:41,003 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4040 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_62| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_63| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_61| Int) (v_ArrVal_4050 Int) (v_ArrVal_4057 Int) (v_ArrVal_4042 Int) (v_ArrVal_4032 Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_4032) (+ |c_#Ultimate.C_memcpy_dest.offset| 1) v_ArrVal_4040) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_61| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4042) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_62| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4050) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_63| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4057)) |c_#memory_int|) (<= 2 |v_#Ultimate.C_memcpy_#t~loopctr1317_61|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_62| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_63|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_61| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_62|))) is different from true [2022-12-13 11:25:41,292 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4040 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_62| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_63| Int) (v_ArrVal_4060 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_61| Int) (v_ArrVal_4050 Int) (v_ArrVal_4057 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1326_35| Int) (v_ArrVal_4042 Int) (v_ArrVal_4032 Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_4032) (+ |c_#Ultimate.C_memcpy_dest.offset| 1) v_ArrVal_4040) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_61| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4042) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_62| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4050) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_63| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4057) (+ |v_#Ultimate.C_memcpy_#t~loopctr1326_35| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_4060)) |c_#memory_int|) (<= 2 |v_#Ultimate.C_memcpy_#t~loopctr1317_61|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_62| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_63|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1326_35|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_61| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_62|))) is different from true [2022-12-13 11:25:41,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:25:41,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:25:41,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:25:41,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:25:41,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:25:41,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:25:41,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:25:41,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:25:41,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:25:41,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:25:41,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:25:41,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:25:41,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:25:41,462 INFO L321 Elim1Store]: treesize reduction 73, result has 48.6 percent of original size [2022-12-13 11:25:41,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 16 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 91 [2022-12-13 11:25:41,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 73 [2022-12-13 11:25:41,522 INFO L321 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-12-13 11:25:41,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 103 [2022-12-13 11:25:41,572 INFO L321 Elim1Store]: treesize reduction 118, result has 7.1 percent of original size [2022-12-13 11:25:41,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 101 treesize of output 69 [2022-12-13 11:25:45,045 INFO L321 Elim1Store]: treesize reduction 93, result has 7.9 percent of original size [2022-12-13 11:25:45,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 171 treesize of output 112 [2022-12-13 11:25:45,272 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 15 proven. 37 refuted. 0 times theorem prover too weak. 74 trivial. 13 not checked. [2022-12-13 11:25:45,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:26:05,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563738511] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:26:05,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:26:05,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 46] total 70 [2022-12-13 11:26:05,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123306359] [2022-12-13 11:26:05,273 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:26:05,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-12-13 11:26:05,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:26:05,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-12-13 11:26:05,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=5363, Unknown=12, NotChecked=596, Total=6162 [2022-12-13 11:26:05,275 INFO L87 Difference]: Start difference. First operand 130 states and 151 transitions. Second operand has 70 states, 62 states have (on average 2.032258064516129) internal successors, (126), 53 states have internal predecessors, (126), 19 states have call successors, (44), 10 states have call predecessors, (44), 15 states have return successors, (41), 24 states have call predecessors, (41), 17 states have call successors, (41) [2022-12-13 11:26:09,313 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-13 11:26:11,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:26:59,463 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-13 11:27:04,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:27:12,986 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-13 11:27:28,425 WARN L233 SmtUtils]: Spent 6.31s on a formula simplification. DAG size of input: 75 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:27:49,241 WARN L233 SmtUtils]: Spent 8.20s on a formula simplification. DAG size of input: 58 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:27:52,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:27:52,454 INFO L93 Difference]: Finished difference Result 246 states and 289 transitions. [2022-12-13 11:27:52,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-12-13 11:27:52,455 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 62 states have (on average 2.032258064516129) internal successors, (126), 53 states have internal predecessors, (126), 19 states have call successors, (44), 10 states have call predecessors, (44), 15 states have return successors, (41), 24 states have call predecessors, (41), 17 states have call successors, (41) Word has length 138 [2022-12-13 11:27:52,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:27:52,456 INFO L225 Difference]: With dead ends: 246 [2022-12-13 11:27:52,456 INFO L226 Difference]: Without dead ends: 194 [2022-12-13 11:27:52,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 136 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3542 ImplicationChecksByTransitivity, 81.4s TimeCoverageRelationStatistics Valid=737, Invalid=17062, Unknown=39, NotChecked=1068, Total=18906 [2022-12-13 11:27:52,458 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 351 mSDsluCounter, 1230 mSDsCounter, 0 mSdLazyCounter, 6816 mSolverCounterSat, 221 mSolverCounterUnsat, 29 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 7747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 6816 IncrementalHoareTripleChecker+Invalid, 29 IncrementalHoareTripleChecker+Unknown, 681 IncrementalHoareTripleChecker+Unchecked, 46.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:27:52,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1280 Invalid, 7747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 6816 Invalid, 29 Unknown, 681 Unchecked, 46.4s Time] [2022-12-13 11:27:52,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-12-13 11:27:52,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 187. [2022-12-13 11:27:52,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 121 states have (on average 1.115702479338843) internal successors, (135), 125 states have internal predecessors, (135), 41 states have call successors, (41), 20 states have call predecessors, (41), 24 states have return successors, (43), 41 states have call predecessors, (43), 39 states have call successors, (43) [2022-12-13 11:27:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 219 transitions. [2022-12-13 11:27:52,479 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 219 transitions. Word has length 138 [2022-12-13 11:27:52,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:27:52,479 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 219 transitions. [2022-12-13 11:27:52,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 62 states have (on average 2.032258064516129) internal successors, (126), 53 states have internal predecessors, (126), 19 states have call successors, (44), 10 states have call predecessors, (44), 15 states have return successors, (41), 24 states have call predecessors, (41), 17 states have call successors, (41) [2022-12-13 11:27:52,480 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 219 transitions. [2022-12-13 11:27:52,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-12-13 11:27:52,480 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:27:52,480 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 11:27:52,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 11:27:52,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 11:27:52,681 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:27:52,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:27:52,681 INFO L85 PathProgramCache]: Analyzing trace with hash 999261336, now seen corresponding path program 6 times [2022-12-13 11:27:52,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:27:52,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325012790] [2022-12-13 11:27:52,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:27:52,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:27:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:53,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:27:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:53,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 11:27:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:53,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:27:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:53,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:27:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:53,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 11:27:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:53,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:27:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:53,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:27:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:53,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 11:27:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:53,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 11:27:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:53,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 11:27:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:53,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:27:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:53,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 11:27:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:53,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:27:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:53,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:27:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:53,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:27:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:53,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:27:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:53,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 11:27:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:53,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:27:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:53,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 11:27:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:53,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:27:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:53,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 11:27:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:53,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-12-13 11:27:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:27:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-12-13 11:27:53,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:27:53,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325012790] [2022-12-13 11:27:53,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325012790] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:27:53,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416452503] [2022-12-13 11:27:53,901 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 11:27:53,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:27:53,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:27:53,902 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:27:53,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 11:28:19,024 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-12-13 11:28:19,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:28:19,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 3562 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-13 11:28:19,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:28:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-12-13 11:28:19,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:28:19,676 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-12-13 11:28:19,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416452503] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:28:19,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:28:19,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 12] total 28 [2022-12-13 11:28:19,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951152159] [2022-12-13 11:28:19,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:28:19,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 11:28:19,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:28:19,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 11:28:19,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2022-12-13 11:28:19,678 INFO L87 Difference]: Start difference. First operand 187 states and 219 transitions. Second operand has 28 states, 28 states have (on average 3.3214285714285716) internal successors, (93), 24 states have internal predecessors, (93), 2 states have call successors, (31), 6 states have call predecessors, (31), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-12-13 11:28:30,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:28:30,558 INFO L93 Difference]: Finished difference Result 249 states and 296 transitions. [2022-12-13 11:28:30,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 11:28:30,559 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.3214285714285716) internal successors, (93), 24 states have internal predecessors, (93), 2 states have call successors, (31), 6 states have call predecessors, (31), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 140 [2022-12-13 11:28:30,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:28:30,560 INFO L225 Difference]: With dead ends: 249 [2022-12-13 11:28:30,560 INFO L226 Difference]: Without dead ends: 141 [2022-12-13 11:28:30,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 306 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=400, Invalid=1670, Unknown=0, NotChecked=0, Total=2070 [2022-12-13 11:28:30,561 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 252 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 1356 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:28:30,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 724 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1356 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-12-13 11:28:30,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-12-13 11:28:30,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 136. [2022-12-13 11:28:30,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 88 states have (on average 1.1022727272727273) internal successors, (97), 90 states have internal predecessors, (97), 31 states have call successors, (31), 15 states have call predecessors, (31), 16 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-12-13 11:28:30,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 159 transitions. [2022-12-13 11:28:30,577 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 159 transitions. Word has length 140 [2022-12-13 11:28:30,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:28:30,578 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 159 transitions. [2022-12-13 11:28:30,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.3214285714285716) internal successors, (93), 24 states have internal predecessors, (93), 2 states have call successors, (31), 6 states have call predecessors, (31), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-12-13 11:28:30,578 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 159 transitions. [2022-12-13 11:28:30,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-12-13 11:28:30,578 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:28:30,579 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 11:28:30,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 11:28:30,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 11:28:30,780 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:28:30,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:28:30,781 INFO L85 PathProgramCache]: Analyzing trace with hash -393149030, now seen corresponding path program 7 times [2022-12-13 11:28:30,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:28:30,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889850113] [2022-12-13 11:28:30,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:28:30,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:28:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:32,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:28:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:32,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 11:28:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:32,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:28:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:32,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:28:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:32,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 11:28:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:32,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:28:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:32,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:28:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:32,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 11:28:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:32,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 11:28:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:32,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 11:28:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:32,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:28:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:32,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 11:28:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:32,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:28:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:32,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:28:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:32,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:28:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:32,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:28:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:32,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 11:28:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:32,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:28:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:32,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 11:28:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:32,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:28:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:32,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 11:28:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:32,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-12-13 11:28:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:32,945 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-12-13 11:28:32,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:28:32,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889850113] [2022-12-13 11:28:32,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889850113] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:28:32,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509929662] [2022-12-13 11:28:32,945 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 11:28:32,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:28:32,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:28:32,946 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:28:32,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 11:28:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:28:33,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 3713 conjuncts, 176 conjunts are in the unsatisfiable core [2022-12-13 11:28:33,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:28:34,375 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:28:34,557 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6609 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| Int)) (let ((.cse0 (* |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| 18446744073709551616))) (and (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68|) (<= 0 (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68|)) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| 1) |c_#Ultimate.C_memcpy_#t~loopctr1317|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6609)) |c_#memory_int|)))) is different from true [2022-12-13 11:28:34,588 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6609 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| Int) (v_ArrVal_6611 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_101| Int)) (let ((.cse0 (* |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| 18446744073709551616))) (and (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68|) (<= 0 (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68|)) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_101|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_101| 1) |c_#Ultimate.C_memcpy_#t~loopctr1317|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6609) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_101| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6611)) |c_#memory_int|)))) is different from true [2022-12-13 11:28:34,632 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6609 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| Int) (v_ArrVal_6611 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| Int) (v_ArrVal_6621 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_101| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_102| Int)) (let ((.cse0 (* |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| 18446744073709551616))) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6609) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_101| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6611) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_102| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6621)) |c_#memory_int|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68|) (<= 0 (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68|)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_101| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_102|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_102| 1) |c_#Ultimate.C_memcpy_#t~loopctr1317|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_101|)))) is different from true [2022-12-13 11:28:34,686 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6609 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| Int) (v_ArrVal_6623 Int) (v_ArrVal_6611 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| Int) (v_ArrVal_6621 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_103| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_101| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_102| Int)) (let ((.cse0 (* |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| 18446744073709551616))) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_102| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_103|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68|) (<= 0 (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68|)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_101| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_102|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_101|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_103| 1) |c_#Ultimate.C_memcpy_#t~loopctr1317|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6609) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_101| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6611) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_102| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6621) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_103| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6623)))))) is different from true [2022-12-13 11:28:34,757 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6609 Int) (v_ArrVal_6629 Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| Int) (v_ArrVal_6623 Int) (v_ArrVal_6611 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| Int) (v_ArrVal_6621 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_103| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_104| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_101| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_102| Int)) (let ((.cse0 (* |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| 18446744073709551616))) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_103| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_104|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_102| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_103|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68|) (<= 0 (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68|)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_101| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_102|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6609) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_101| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6611) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_102| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6621) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_103| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6623) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_104| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6629)) |c_#memory_int|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_101|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_104| 1) |c_#Ultimate.C_memcpy_#t~loopctr1317|)))) is different from true [2022-12-13 11:28:34,850 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6609 Int) (v_ArrVal_6629 Int) (v_ArrVal_6638 Int) (v_ArrVal_6623 Int) (v_ArrVal_6611 Int) (v_ArrVal_6621 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_105| Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_103| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_104| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_101| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_102| Int)) (let ((.cse0 (* |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| 18446744073709551616))) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_103| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_104|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_102| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_103|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68|) (<= 0 (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68|)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_101| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_102|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_104| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_105|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6609) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_101| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6611) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_102| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6621) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_103| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6623) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_104| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6629) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_105| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6638))) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_101|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_105| 1) |c_#Ultimate.C_memcpy_#t~loopctr1317|)))) is different from true [2022-12-13 11:28:34,960 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6609 Int) (v_ArrVal_6629 Int) (v_ArrVal_6638 Int) (v_ArrVal_6623 Int) (v_ArrVal_6611 Int) (v_ArrVal_6621 Int) (v_ArrVal_6643 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_105| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_106| Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_103| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_104| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_101| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_102| Int)) (let ((.cse0 (* |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| 18446744073709551616))) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_103| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_104|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_102| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_103|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68|) (<= 0 (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68|)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_101| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_102|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_105| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_106|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_104| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_105|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_101|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6609) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_101| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6611) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_102| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6621) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_103| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6623) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_104| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6629) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_105| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6638) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_106| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6643)) |c_#memory_int|)))) is different from true [2022-12-13 11:28:35,525 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6609 Int) (v_ArrVal_6629 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1326_52| Int) (v_ArrVal_6638 Int) (v_ArrVal_6648 Int) (v_ArrVal_6623 Int) (v_ArrVal_6611 Int) (v_ArrVal_6621 Int) (v_ArrVal_6643 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_105| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_106| Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_103| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_104| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_101| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_102| Int)) (let ((.cse0 (* |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| 18446744073709551616))) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1326_52| 8) |c_#Ultimate.C_memcpy_#t~loopctr1326|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_103| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_104|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_102| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_103|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68|) (<= 0 (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68|)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_101| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_102|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_105| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_106|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_104| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_105|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_101|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6609) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_101| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6611) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_102| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6621) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_103| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6623) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_104| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6629) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_105| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6638) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_106| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6643) (+ |v_#Ultimate.C_memcpy_#t~loopctr1326_52| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6648)) |c_#memory_int|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1326_52|)))) is different from true [2022-12-13 11:28:35,747 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6609 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1326_53| Int) (v_ArrVal_6629 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1326_52| Int) (v_ArrVal_6638 Int) (v_ArrVal_6648 Int) (v_ArrVal_6623 Int) (v_ArrVal_6611 Int) (v_ArrVal_6621 Int) (v_ArrVal_6643 Int) (v_ArrVal_6650 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_105| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_106| Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_103| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_104| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_101| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_102| Int)) (let ((.cse0 (* |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| 18446744073709551616))) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_103| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_104|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1326_52| 8) |v_#Ultimate.C_memcpy_#t~loopctr1326_53|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_102| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_103|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68|) (<= 0 (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68|)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_101| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_102|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_105| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_106|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_104| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_105|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6609) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_101| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6611) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_102| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6621) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_103| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6623) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_104| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6629) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_105| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6638) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_106| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6643) (+ |v_#Ultimate.C_memcpy_#t~loopctr1326_52| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6648) (+ |v_#Ultimate.C_memcpy_#t~loopctr1326_53| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6650)) |c_#memory_int|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_101|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1326_52|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1326_53| 8) |c_#Ultimate.C_memcpy_#t~loopctr1326|)))) is different from true [2022-12-13 11:28:36,051 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6609 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1326_54| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1326_53| Int) (v_ArrVal_6629 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1326_52| Int) (v_ArrVal_6638 Int) (v_ArrVal_6648 Int) (v_ArrVal_6623 Int) (v_ArrVal_6611 Int) (v_ArrVal_6621 Int) (v_ArrVal_6643 Int) (v_ArrVal_6651 Int) (v_ArrVal_6650 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_105| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_106| Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_103| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_104| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_101| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_102| Int)) (let ((.cse0 (* |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| 18446744073709551616))) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_103| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_104|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1326_52| 8) |v_#Ultimate.C_memcpy_#t~loopctr1326_53|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6609) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_101| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6611) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_102| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6621) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_103| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6623) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_104| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6629) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_105| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6638) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_106| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6643) (+ |v_#Ultimate.C_memcpy_#t~loopctr1326_52| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6648) (+ |v_#Ultimate.C_memcpy_#t~loopctr1326_53| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6650) (+ |v_#Ultimate.C_memcpy_#t~loopctr1326_54| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6651)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_102| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_103|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68|) (<= 0 (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68|)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_101| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_102|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_105| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_106|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1326_53| 8) |v_#Ultimate.C_memcpy_#t~loopctr1326_54|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_104| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_105|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1317_100_68| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_101|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1326_52|)))) is different from true [2022-12-13 11:28:36,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:28:36,932 INFO L321 Elim1Store]: treesize reduction 390, result has 27.6 percent of original size [2022-12-13 11:28:36,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 34 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 71 treesize of output 188 [2022-12-13 11:28:37,106 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 11:28:37,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 35 [2022-12-13 11:28:38,015 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-12-13 11:28:38,016 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 69 [2022-12-13 11:28:38,168 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 12 proven. 37 refuted. 0 times theorem prover too weak. 74 trivial. 34 not checked. [2022-12-13 11:28:38,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:29:00,633 WARN L233 SmtUtils]: Spent 20.87s on a formula simplification that was a NOOP. DAG size: 242 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:30:11,694 WARN L233 SmtUtils]: Spent 22.35s on a formula simplification that was a NOOP. DAG size: 259 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:30:11,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509929662] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:30:11,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:30:11,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 45] total 59 [2022-12-13 11:30:11,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705423875] [2022-12-13 11:30:11,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:30:11,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-12-13 11:30:11,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:30:11,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-12-13 11:30:11,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=3160, Unknown=22, NotChecked=1210, Total=4556 [2022-12-13 11:30:11,702 INFO L87 Difference]: Start difference. First operand 136 states and 159 transitions. Second operand has 59 states, 53 states have (on average 2.2641509433962264) internal successors, (120), 43 states have internal predecessors, (120), 10 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (34), 13 states have call predecessors, (34), 8 states have call successors, (34) [2022-12-13 11:30:47,307 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-13 11:30:52,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:30:52,808 INFO L93 Difference]: Finished difference Result 192 states and 225 transitions. [2022-12-13 11:30:52,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-13 11:30:52,809 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 53 states have (on average 2.2641509433962264) internal successors, (120), 43 states have internal predecessors, (120), 10 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (34), 13 states have call predecessors, (34), 8 states have call successors, (34) Word has length 142 [2022-12-13 11:30:52,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:30:52,810 INFO L225 Difference]: With dead ends: 192 [2022-12-13 11:30:52,810 INFO L226 Difference]: Without dead ends: 138 [2022-12-13 11:30:52,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1164 ImplicationChecksByTransitivity, 73.4s TimeCoverageRelationStatistics Valid=372, Invalid=7301, Unknown=23, NotChecked=1810, Total=9506 [2022-12-13 11:30:52,811 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 194 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 4498 mSolverCounterSat, 147 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 6136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 4498 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 1488 IncrementalHoareTripleChecker+Unchecked, 31.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:30:52,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1397 Invalid, 6136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 4498 Invalid, 3 Unknown, 1488 Unchecked, 31.4s Time] [2022-12-13 11:30:52,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-12-13 11:30:52,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2022-12-13 11:30:52,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 88 states have (on average 1.0909090909090908) internal successors, (96), 90 states have internal predecessors, (96), 31 states have call successors, (31), 15 states have call predecessors, (31), 16 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-12-13 11:30:52,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 158 transitions. [2022-12-13 11:30:52,828 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 158 transitions. Word has length 142 [2022-12-13 11:30:52,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:30:52,828 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 158 transitions. [2022-12-13 11:30:52,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 53 states have (on average 2.2641509433962264) internal successors, (120), 43 states have internal predecessors, (120), 10 states have call successors, (39), 10 states have call predecessors, (39), 9 states have return successors, (34), 13 states have call predecessors, (34), 8 states have call successors, (34) [2022-12-13 11:30:52,829 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 158 transitions. [2022-12-13 11:30:52,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-12-13 11:30:52,829 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:30:52,829 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 11:30:52,840 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 11:30:53,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 11:30:53,031 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:30:53,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:30:53,032 INFO L85 PathProgramCache]: Analyzing trace with hash 339575234, now seen corresponding path program 8 times [2022-12-13 11:30:53,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:30:53,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533893757] [2022-12-13 11:30:53,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:30:53,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:30:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:30:56,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 11:30:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:30:56,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 11:30:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:30:56,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:30:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:30:56,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:30:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:30:57,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 11:30:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:30:57,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 11:30:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:30:57,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:30:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:30:57,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 11:30:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:30:57,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 11:30:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:30:57,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 11:30:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:30:57,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:30:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:30:57,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-12-13 11:30:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:30:57,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:30:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:30:57,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:30:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:30:57,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:30:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:30:57,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:30:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:30:57,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 11:30:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:30:57,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:30:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:30:57,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 11:30:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:30:57,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:30:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:30:57,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 11:30:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:30:59,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-12-13 11:30:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:30:59,146 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 21 proven. 72 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-12-13 11:30:59,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:30:59,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533893757] [2022-12-13 11:30:59,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533893757] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:30:59,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611692501] [2022-12-13 11:30:59,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 11:30:59,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:30:59,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:30:59,148 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:30:59,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a7ebde2-1950-460a-b7a1-5ce5e6fa9de4/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 11:31:00,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 11:31:00,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:31:00,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 3946 conjuncts, 148 conjunts are in the unsatisfiable core [2022-12-13 11:31:00,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:31:00,892 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:31:01,171 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8383 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_131| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_131| 1) |c_#Ultimate.C_memcpy_#t~loopctr1317|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1317_131|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_131| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8383)) |c_#memory_int|))) is different from true [2022-12-13 11:31:01,188 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8383 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_132| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_131| Int) (v_ArrVal_8388 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_132| 1) |c_#Ultimate.C_memcpy_#t~loopctr1317|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1317_131|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_131| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8383) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_132| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8388))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_131| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_132|))) is different from true [2022-12-13 11:31:01,213 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8383 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_132| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_133| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_131| Int) (v_ArrVal_8398 Int) (v_ArrVal_8388 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_133| 1) |c_#Ultimate.C_memcpy_#t~loopctr1317|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_131| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8383) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_132| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8388) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_133| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8398)) |c_#memory_int|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1317_131|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_132| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_133|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_131| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_132|))) is different from true [2022-12-13 11:31:01,244 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8383 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_132| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_133| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_131| Int) (v_ArrVal_8398 Int) (v_ArrVal_8388 Int) (v_ArrVal_8399 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_134| Int)) (and (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1317_131|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_134| 1) |c_#Ultimate.C_memcpy_#t~loopctr1317|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_131| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8383) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_132| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8388) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_133| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8398) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_134| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8399))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_132| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_133|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_133| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_134|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_131| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_132|))) is different from true [2022-12-13 11:31:01,290 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8383 Int) (v_ArrVal_8406 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_132| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_133| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_131| Int) (v_ArrVal_8398 Int) (v_ArrVal_8388 Int) (v_ArrVal_8399 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_134| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_135| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_135| 1) |c_#Ultimate.C_memcpy_#t~loopctr1317|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_131| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8383) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_132| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8388) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_133| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8398) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_134| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8399) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_135| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8406)) |c_#memory_int|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1317_131|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_134| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_135|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_132| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_133|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_133| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_134|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_131| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_132|))) is different from true [2022-12-13 11:31:01,357 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8406 Int) (v_ArrVal_8398 Int) (v_ArrVal_8388 Int) (v_ArrVal_8399 Int) (v_ArrVal_8411 Int) (v_ArrVal_8383 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_132| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_133| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_131| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_136| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_134| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_135| Int)) (and (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1317_131|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_134| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_135|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_135| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_136|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_132| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_133|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_131| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8383) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_132| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8388) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_133| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8398) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_134| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8399) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_135| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8406) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_136| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8411))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_133| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_134|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_136| 1) |c_#Ultimate.C_memcpy_#t~loopctr1317|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_131| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_132|))) is different from true [2022-12-13 11:31:01,444 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8406 Int) (v_ArrVal_8398 Int) (v_ArrVal_8420 Int) (v_ArrVal_8388 Int) (v_ArrVal_8399 Int) (v_ArrVal_8411 Int) (v_ArrVal_8383 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_132| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_133| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_131| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_136| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_137| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_134| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_135| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_137| 1) |c_#Ultimate.C_memcpy_#t~loopctr1317|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_131| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8383) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_132| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8388) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_133| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8398) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_134| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8399) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_135| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8406) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_136| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8411) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_137| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8420)) |c_#memory_int|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1317_131|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_134| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_135|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_135| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_136|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_132| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_133|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_133| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_134|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_131| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_132|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_136| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_137|))) is different from true [2022-12-13 11:31:01,563 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8406 Int) (v_ArrVal_8424 Int) (v_ArrVal_8398 Int) (v_ArrVal_8420 Int) (v_ArrVal_8388 Int) (v_ArrVal_8399 Int) (v_ArrVal_8411 Int) (v_ArrVal_8383 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_138| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_132| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_133| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_131| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_136| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_137| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_134| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_135| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_137| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_138|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1317_131|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_138| 1) |c_#Ultimate.C_memcpy_#t~loopctr1317|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_134| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_135|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_135| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_136|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_132| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_133|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_133| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_134|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_131| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8383) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_132| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8388) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_133| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8398) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_134| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8399) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_135| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8406) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_136| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8411) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_137| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8420) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_138| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8424))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_131| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_132|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_136| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_137|))) is different from true [2022-12-13 11:31:01,706 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8406 Int) (v_ArrVal_8424 Int) (v_ArrVal_8398 Int) (v_ArrVal_8420 Int) (v_ArrVal_8431 Int) (v_ArrVal_8388 Int) (v_ArrVal_8399 Int) (v_ArrVal_8411 Int) (v_ArrVal_8383 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_138| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_139| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_132| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_133| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_131| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_136| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_137| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_134| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_135| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_137| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_138|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_138| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_139|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1317_131|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_131| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8383) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_132| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8388) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_133| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8398) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_134| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8399) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_135| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8406) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_136| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8411) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_137| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8420) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_138| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8424) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_139| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8431)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_134| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_135|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_135| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_136|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_132| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_133|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_133| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_134|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_131| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_132|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_136| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_137|))) is different from true [2022-12-13 11:31:02,467 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8406 Int) (v_ArrVal_8424 Int) (v_ArrVal_8435 Int) (v_ArrVal_8398 Int) (v_ArrVal_8420 Int) (v_ArrVal_8431 Int) (v_ArrVal_8388 Int) (v_ArrVal_8399 Int) (v_ArrVal_8411 Int) (v_ArrVal_8383 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_138| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_139| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_132| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_133| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_131| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_136| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_137| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_134| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1326_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_135| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_137| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_138|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_138| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_139|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1317_131|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_134| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_135|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_135| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_136|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1326_67| 8) |c_#Ultimate.C_memcpy_#t~loopctr1326|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_132| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_133|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_133| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_134|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_131| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8383) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_132| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8388) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_133| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8398) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_134| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8399) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_135| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8406) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_136| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8411) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_137| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8420) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_138| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8424) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_139| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8431) (+ |v_#Ultimate.C_memcpy_#t~loopctr1326_67| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8435)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_131| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_132|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1326_67|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_136| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_137|))) is different from true [2022-12-13 11:31:02,751 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_8406 Int) (v_ArrVal_8424 Int) (v_ArrVal_8435 Int) (v_ArrVal_8438 Int) (v_ArrVal_8398 Int) (v_ArrVal_8420 Int) (v_ArrVal_8431 Int) (v_ArrVal_8388 Int) (v_ArrVal_8399 Int) (v_ArrVal_8411 Int) (v_ArrVal_8383 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_138| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_139| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_132| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_133| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_131| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_136| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_137| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1326_68| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_134| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1326_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_135| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_137| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_138|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_131| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8383) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_132| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8388) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_133| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8398) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_134| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8399) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_135| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8406) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_136| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8411) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_137| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8420) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_138| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8424) (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_139| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8431) (+ |v_#Ultimate.C_memcpy_#t~loopctr1326_67| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8435) (+ |v_#Ultimate.C_memcpy_#t~loopctr1326_68| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_8438))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1326_67| 8) |v_#Ultimate.C_memcpy_#t~loopctr1326_68|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_138| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_139|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1317_131|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_134| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_135|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_135| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_136|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_132| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_133|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_133| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_134|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_131| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_132|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1326_67|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_136| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_137|))) is different from true [2022-12-13 11:31:03,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:31:03,585 INFO L321 Elim1Store]: treesize reduction 279, result has 34.2 percent of original size [2022-12-13 11:31:03,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 48 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 73 treesize of output 175 [2022-12-13 11:31:03,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 82 [2022-12-13 11:31:03,693 INFO L321 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-12-13 11:31:03,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 108 [2022-12-13 11:31:04,856 INFO L321 Elim1Store]: treesize reduction 93, result has 7.9 percent of original size [2022-12-13 11:31:04,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 191 treesize of output 122 [2022-12-13 11:31:05,129 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 83 trivial. 48 not checked. [2022-12-13 11:31:05,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:31:47,883 WARN L233 SmtUtils]: Spent 40.78s on a formula simplification that was a NOOP. DAG size: 281 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 11:32:00,722 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (mod c_aws_string_new_from_array_~len 18446744073709551616))) (let ((.cse11 (<= .cse10 9223372036854775807)) (.cse2 (+ c_aws_string_new_from_array_~str~2.offset 8)) (.cse3 (select |c_#memory_int| c_aws_string_new_from_array_~str~2.base)) (.cse5 (+ c_aws_string_new_from_array_~str~2.offset 16))) (and (or (let ((.cse4 (+ c_aws_string_new_from_array_~str~2.offset .cse10 (- 18446744073709551600)))) (and (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_167| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_168| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_168| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_167|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_169| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_163| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_164| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_164| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_163|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_166| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_165| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_166| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_165|)) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_165| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_164|)) (forall ((|v_#Ultimate.C_memcpy_dest.offset_28| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_162| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_161| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1326_76| Int)) (or (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1326_76|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1326_75| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1326_76| 8) |v_#Ultimate.C_memcpy_#t~loopctr1326_75|)) (forall ((v_ArrVal_8516 Int) (v_ArrVal_8517 Int) (v_ArrVal_8518 Int) (v_ArrVal_8519 Int) (v_ArrVal_8512 Int) (v_ArrVal_8513 Int) (v_ArrVal_8514 Int) (v_ArrVal_8515 Int) (v_ArrVal_8520 Int) (v_ArrVal_8510 Int) (v_ArrVal_8511 Int)) (let ((.cse0 (store (store (store (store (store (store (store (store (store (store (store (store .cse3 (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_161|) v_ArrVal_8513) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_169|) v_ArrVal_8511) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_168|) v_ArrVal_8515) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_167|) v_ArrVal_8510) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_166|) v_ArrVal_8520) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_165|) v_ArrVal_8512) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_164|) v_ArrVal_8514) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_163|) v_ArrVal_8517) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_162|) v_ArrVal_8516) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1326_76|) v_ArrVal_8519) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1326_75|) v_ArrVal_8518) .cse4 0))) (let ((.cse1 (mod (select .cse0 .cse2) 18446744073709551616))) (or (= (mod (select .cse0 (+ c_aws_string_new_from_array_~str~2.offset (- 18446744073709551600) .cse1)) 256) 0) (= (mod (select .cse0 (+ c_aws_string_new_from_array_~str~2.offset 16 .cse1)) 256) 0))))))))) (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1317_161|)) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_161| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_169|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_163| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_162|)))) (not (<= .cse5 |v_#Ultimate.C_memcpy_dest.offset_28|)))))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_167| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_166|)))))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_169| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_168|)))))) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_167| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_168| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_169| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_163| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_164| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_166| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_165| Int)) (or (forall ((|v_#Ultimate.C_memcpy_dest.offset_28| Int)) (or (not (<= .cse5 |v_#Ultimate.C_memcpy_dest.offset_28|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_162| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_161| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1326_76| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1326_75| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1326_76| 8) |v_#Ultimate.C_memcpy_#t~loopctr1326_75|)) (forall ((v_ArrVal_8516 Int) (v_ArrVal_8517 Int) (v_ArrVal_8518 Int) (v_ArrVal_8519 Int) (v_ArrVal_8512 Int) (v_ArrVal_8513 Int) (v_ArrVal_8514 Int) (v_ArrVal_8515 Int) (v_ArrVal_8520 Int) (v_ArrVal_8510 Int) (v_ArrVal_8511 Int)) (let ((.cse7 (store (store (store (store (store (store (store (store (store (store (store (store .cse3 (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_161|) v_ArrVal_8513) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_169|) v_ArrVal_8511) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_168|) v_ArrVal_8515) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_167|) v_ArrVal_8510) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_166|) v_ArrVal_8520) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_165|) v_ArrVal_8512) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_164|) v_ArrVal_8514) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_163|) v_ArrVal_8517) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_162|) v_ArrVal_8516) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1326_76|) v_ArrVal_8519) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1326_75|) v_ArrVal_8518) .cse4 0))) (let ((.cse6 (mod (select .cse7 .cse2) 18446744073709551616))) (or (not (<= .cse6 9223372036854775807)) (= (mod (select .cse7 (+ c_aws_string_new_from_array_~str~2.offset 16 .cse6)) 256) 0))))))) (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1326_76|)))) (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1317_161|)) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_161| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_169|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_163| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_162|)))))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_166| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_165|)) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_165| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_164|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_167| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_166|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_164| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_163|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_169| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_168|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_168| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_167|)))) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_167| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_168| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_168| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_167|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_169| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_163| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_164| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_166| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_165| Int)) (or (forall ((|v_#Ultimate.C_memcpy_dest.offset_28| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_162| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_163| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_162|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_161| Int)) (or (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1317_161|)) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_161| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_169|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1326_76| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1326_75| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1326_76| 8) |v_#Ultimate.C_memcpy_#t~loopctr1326_75|)) (forall ((v_ArrVal_8516 Int) (v_ArrVal_8517 Int) (v_ArrVal_8518 Int) (v_ArrVal_8519 Int) (v_ArrVal_8512 Int) (v_ArrVal_8513 Int) (v_ArrVal_8514 Int) (v_ArrVal_8515 Int) (v_ArrVal_8520 Int) (v_ArrVal_8510 Int) (v_ArrVal_8511 Int)) (let ((.cse9 (store (store (store (store (store (store (store (store (store (store (store (store .cse3 (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_161|) v_ArrVal_8513) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_169|) v_ArrVal_8511) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_168|) v_ArrVal_8515) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_167|) v_ArrVal_8510) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_166|) v_ArrVal_8520) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_165|) v_ArrVal_8512) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_164|) v_ArrVal_8514) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_163|) v_ArrVal_8517) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_162|) v_ArrVal_8516) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1326_76|) v_ArrVal_8519) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1326_75|) v_ArrVal_8518) .cse4 0))) (let ((.cse8 (mod (select .cse9 .cse2) 18446744073709551616))) (or (<= .cse8 9223372036854775807) (= (mod (select .cse9 (+ c_aws_string_new_from_array_~str~2.offset (- 18446744073709551600) .cse8)) 256) 0))))))) (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1326_76|)))))))) (not (<= .cse5 |v_#Ultimate.C_memcpy_dest.offset_28|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_166| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_165|)) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_165| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_164|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_167| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_166|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_164| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_163|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_169| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_168|)))))))) .cse11) (or (not .cse11) (let ((.cse14 (+ c_aws_string_new_from_array_~str~2.offset .cse10 16))) (and (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_167| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_168| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_169| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_169| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_168|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_163| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_164| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_166| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_165| Int)) (or (forall ((|v_#Ultimate.C_memcpy_dest.offset_28| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_162| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_163| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_162|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_161| Int)) (or (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1317_161|)) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_161| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_169|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1326_76| Int)) (or (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1326_76|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1326_75| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1326_76| 8) |v_#Ultimate.C_memcpy_#t~loopctr1326_75|)) (forall ((v_ArrVal_8516 Int) (v_ArrVal_8517 Int) (v_ArrVal_8518 Int) (v_ArrVal_8519 Int) (v_ArrVal_8512 Int) (v_ArrVal_8513 Int) (v_ArrVal_8514 Int) (v_ArrVal_8515 Int) (v_ArrVal_8520 Int) (v_ArrVal_8510 Int) (v_ArrVal_8511 Int)) (let ((.cse12 (store (store (store (store (store (store (store (store (store (store (store (store .cse3 (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_161|) v_ArrVal_8513) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_169|) v_ArrVal_8511) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_168|) v_ArrVal_8515) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_167|) v_ArrVal_8510) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_166|) v_ArrVal_8520) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_165|) v_ArrVal_8512) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_164|) v_ArrVal_8514) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_163|) v_ArrVal_8517) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_162|) v_ArrVal_8516) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1326_76|) v_ArrVal_8519) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1326_75|) v_ArrVal_8518) .cse14 0))) (let ((.cse13 (mod (select .cse12 .cse2) 18446744073709551616))) (or (= (mod (select .cse12 (+ c_aws_string_new_from_array_~str~2.offset .cse13 16)) 256) 0) (not (<= .cse13 9223372036854775807)))))))))))))) (not (<= .cse5 |v_#Ultimate.C_memcpy_dest.offset_28|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_166| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_165|)) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_165| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_164|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_167| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_166|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_164| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_163|)))))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_168| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_167|)))) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_167| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_168| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_168| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_167|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_169| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_163| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_164| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_166| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_165| Int)) (or (forall ((|v_#Ultimate.C_memcpy_dest.offset_28| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_162| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_161| Int)) (or (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1317_161|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1326_76| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1326_75| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1326_76| 8) |v_#Ultimate.C_memcpy_#t~loopctr1326_75|)) (forall ((v_ArrVal_8516 Int) (v_ArrVal_8517 Int) (v_ArrVal_8518 Int) (v_ArrVal_8519 Int) (v_ArrVal_8512 Int) (v_ArrVal_8513 Int) (v_ArrVal_8514 Int) (v_ArrVal_8515 Int) (v_ArrVal_8520 Int) (v_ArrVal_8510 Int) (v_ArrVal_8511 Int)) (let ((.cse15 (store (store (store (store (store (store (store (store (store (store (store (store .cse3 (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_161|) v_ArrVal_8513) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_169|) v_ArrVal_8511) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_168|) v_ArrVal_8515) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_167|) v_ArrVal_8510) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_166|) v_ArrVal_8520) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_165|) v_ArrVal_8512) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_164|) v_ArrVal_8514) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_163|) v_ArrVal_8517) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_162|) v_ArrVal_8516) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1326_76|) v_ArrVal_8519) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1326_75|) v_ArrVal_8518) .cse14 0))) (let ((.cse16 (mod (select .cse15 .cse2) 18446744073709551616))) (or (= (mod (select .cse15 (+ c_aws_string_new_from_array_~str~2.offset .cse16 (- 18446744073709551600))) 256) 0) (= (mod (select .cse15 (+ c_aws_string_new_from_array_~str~2.offset .cse16 16)) 256) 0))))))) (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1326_76|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_161| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_169|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_163| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_162|)))) (not (<= .cse5 |v_#Ultimate.C_memcpy_dest.offset_28|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_166| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_165|)) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_165| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_164|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_167| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_166|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_164| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_163|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_169| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_168|)))))) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_167| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_168| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_168| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_167|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_169| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_163| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1317_164| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_166| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_167| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_166|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_165| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_166| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_165|)) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_165| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_164|)) (forall ((|v_#Ultimate.C_memcpy_dest.offset_28| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_162| Int)) (or (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1317_161| Int)) (or (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1317_161|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1326_76| Int)) (or (not (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1326_76|)) (forall ((|v_#Ultimate.C_memcpy_#t~loopctr1326_75| Int)) (or (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1326_76| 8) |v_#Ultimate.C_memcpy_#t~loopctr1326_75|)) (forall ((v_ArrVal_8516 Int) (v_ArrVal_8517 Int) (v_ArrVal_8518 Int) (v_ArrVal_8519 Int) (v_ArrVal_8512 Int) (v_ArrVal_8513 Int) (v_ArrVal_8514 Int) (v_ArrVal_8515 Int) (v_ArrVal_8520 Int) (v_ArrVal_8510 Int) (v_ArrVal_8511 Int)) (let ((.cse18 (store (store (store (store (store (store (store (store (store (store (store (store .cse3 (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_161|) v_ArrVal_8513) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_169|) v_ArrVal_8511) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_168|) v_ArrVal_8515) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_167|) v_ArrVal_8510) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_166|) v_ArrVal_8520) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_165|) v_ArrVal_8512) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_164|) v_ArrVal_8514) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_163|) v_ArrVal_8517) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1317_162|) v_ArrVal_8516) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1326_76|) v_ArrVal_8519) (+ |v_#Ultimate.C_memcpy_dest.offset_28| |v_#Ultimate.C_memcpy_#t~loopctr1326_75|) v_ArrVal_8518) .cse14 0))) (let ((.cse17 (mod (select .cse18 .cse2) 18446744073709551616))) (or (<= .cse17 9223372036854775807) (= (mod (select .cse18 (+ c_aws_string_new_from_array_~str~2.offset .cse17 (- 18446744073709551600))) 256) 0))))))))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_161| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_169|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_163| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_162|)))) (not (<= .cse5 |v_#Ultimate.C_memcpy_dest.offset_28|)))))))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_164| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_163|)))) (not (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1317_169| 1) |v_#Ultimate.C_memcpy_#t~loopctr1317_168|)))))))))))) is different from false [2022-12-13 11:32:00,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611692501] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:32:00,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:32:00,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 42] total 71 [2022-12-13 11:32:00,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335549302] [2022-12-13 11:32:00,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 11:32:00,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-12-13 11:32:00,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:32:00,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-12-13 11:32:00,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=4404, Unknown=12, NotChecked=1716, Total=6320 [2022-12-13 11:32:00,760 INFO L87 Difference]: Start difference. First operand 136 states and 158 transitions. Second operand has 71 states, 66 states have (on average 1.8636363636363635) internal successors, (123), 57 states have internal predecessors, (123), 14 states have call successors, (37), 10 states have call predecessors, (37), 13 states have return successors, (35), 19 states have call predecessors, (35), 12 states have call successors, (35) [2022-12-13 11:32:41,869 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-13 11:32:52,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]