./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/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_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/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_2fef09b2-93d9-4a4f-960e-783720c3a754/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 d8feb785efb60d35f9204dc33a12e80ea59efcec5de2b7c2ff320ef29197b0bd --- 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 17:48:57,394 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 17:48:57,396 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 17:48:57,410 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 17:48:57,410 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 17:48:57,411 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 17:48:57,412 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 17:48:57,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 17:48:57,414 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 17:48:57,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 17:48:57,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 17:48:57,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 17:48:57,416 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 17:48:57,417 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 17:48:57,417 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 17:48:57,418 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 17:48:57,419 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 17:48:57,419 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 17:48:57,421 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 17:48:57,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 17:48:57,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 17:48:57,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 17:48:57,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 17:48:57,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 17:48:57,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 17:48:57,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 17:48:57,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 17:48:57,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 17:48:57,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 17:48:57,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 17:48:57,430 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 17:48:57,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 17:48:57,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 17:48:57,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 17:48:57,432 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 17:48:57,432 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 17:48:57,433 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 17:48:57,433 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 17:48:57,433 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 17:48:57,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 17:48:57,434 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 17:48:57,435 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-12-13 17:48:57,450 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 17:48:57,451 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 17:48:57,451 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 17:48:57,451 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 17:48:57,452 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 17:48:57,452 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 17:48:57,452 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 17:48:57,452 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 17:48:57,452 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 17:48:57,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 17:48:57,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 17:48:57,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 17:48:57,453 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 17:48:57,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 17:48:57,453 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 17:48:57,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 17:48:57,453 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 17:48:57,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 17:48:57,454 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 17:48:57,454 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 17:48:57,454 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 17:48:57,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:48:57,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 17:48:57,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 17:48:57,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 17:48:57,454 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 17:48:57,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 17:48:57,455 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 17:48:57,455 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 17:48:57,455 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 17:48:57,455 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 17:48:57,455 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 17:48:57,455 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_2fef09b2-93d9-4a4f-960e-783720c3a754/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_2fef09b2-93d9-4a4f-960e-783720c3a754/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 -> d8feb785efb60d35f9204dc33a12e80ea59efcec5de2b7c2ff320ef29197b0bd [2022-12-13 17:48:57,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 17:48:57,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 17:48:57,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 17:48:57,665 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 17:48:57,665 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 17:48:57,666 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i [2022-12-13 17:49:00,247 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 17:49:00,613 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 17:49:00,614 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i [2022-12-13 17:49:00,636 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/data/fc5a6d30c/9d9e681fd5794ad1ad5cc75538c47d13/FLAG2bb26a7a9 [2022-12-13 17:49:00,648 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/data/fc5a6d30c/9d9e681fd5794ad1ad5cc75538c47d13 [2022-12-13 17:49:00,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 17:49:00,651 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 17:49:00,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 17:49:00,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 17:49:00,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 17:49:00,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:49:00" (1/1) ... [2022-12-13 17:49:00,656 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ecccf1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:49:00, skipping insertion in model container [2022-12-13 17:49:00,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:49:00" (1/1) ... [2022-12-13 17:49:00,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 17:49:00,748 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 17:49:00,957 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_2fef09b2-93d9-4a4f-960e-783720c3a754/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i[4499,4512] [2022-12-13 17:49:00,963 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_2fef09b2-93d9-4a4f-960e-783720c3a754/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i[4559,4572] [2022-12-13 17:49:01,562 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:49:01,563 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:49:01,563 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:49:01,564 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:49:01,565 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:49:01,575 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:49:01,576 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:49:01,578 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:49:01,578 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:49:01,642 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 17:49:01,643 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 17:49:01,643 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 17:49:01,647 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-12-13 17:49:01,648 WARN L623 FunctionHandler]: Unknown extern function htons [2022-12-13 17:49:01,649 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-12-13 17:49:01,874 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-12-13 17:49:01,875 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-12-13 17:49:01,875 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-12-13 17:49:01,876 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-12-13 17:49:01,877 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-12-13 17:49:01,878 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-12-13 17:49:01,878 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-12-13 17:49:01,879 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-12-13 17:49:01,879 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-12-13 17:49:01,880 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-12-13 17:49:01,880 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-12-13 17:49:02,000 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-12-13 17:49:02,027 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-12-13 17:49:02,034 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 17:49:02,056 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 17:49:02,062 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:49:02,062 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:49:02,105 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-12-13 17:49:02,109 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 17:49:02,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:49:02,147 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 17:49:02,156 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_2fef09b2-93d9-4a4f-960e-783720c3a754/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i[4499,4512] [2022-12-13 17:49:02,156 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_2fef09b2-93d9-4a4f-960e-783720c3a754/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i[4559,4572] [2022-12-13 17:49:02,178 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:49:02,178 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:49:02,178 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:49:02,179 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:49:02,179 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:49:02,183 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:49:02,183 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:49:02,183 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:49:02,184 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:49:02,188 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 17:49:02,188 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 17:49:02,188 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 17:49:02,190 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-12-13 17:49:02,191 WARN L623 FunctionHandler]: Unknown extern function htons [2022-12-13 17:49:02,191 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-12-13 17:49:02,214 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-12-13 17:49:02,214 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-12-13 17:49:02,215 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-12-13 17:49:02,215 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-12-13 17:49:02,216 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-12-13 17:49:02,216 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-12-13 17:49:02,217 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-12-13 17:49:02,217 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-12-13 17:49:02,217 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-12-13 17:49:02,218 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-12-13 17:49:02,218 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-12-13 17:49:02,231 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-12-13 17:49:02,244 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-12-13 17:49:02,248 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 17:49:02,258 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 17:49:02,262 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:49:02,263 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 17:49:02,279 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-12-13 17:49:02,281 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 17:49:02,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:49:02,419 INFO L208 MainTranslator]: Completed translation [2022-12-13 17:49:02,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:49:02 WrapperNode [2022-12-13 17:49:02,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 17:49:02,420 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 17:49:02,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 17:49:02,420 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 17:49:02,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:49:02" (1/1) ... [2022-12-13 17:49:02,475 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:49:02" (1/1) ... [2022-12-13 17:49:02,518 INFO L138 Inliner]: procedures = 690, calls = 2734, calls flagged for inlining = 62, calls inlined = 9, statements flattened = 811 [2022-12-13 17:49:02,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 17:49:02,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 17:49:02,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 17:49:02,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 17:49:02,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:49:02" (1/1) ... [2022-12-13 17:49:02,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:49:02" (1/1) ... [2022-12-13 17:49:02,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:49:02" (1/1) ... [2022-12-13 17:49:02,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:49:02" (1/1) ... [2022-12-13 17:49:02,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:49:02" (1/1) ... [2022-12-13 17:49:02,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:49:02" (1/1) ... [2022-12-13 17:49:02,560 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:49:02" (1/1) ... [2022-12-13 17:49:02,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:49:02" (1/1) ... [2022-12-13 17:49:02,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 17:49:02,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 17:49:02,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 17:49:02,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 17:49:02,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:49:02" (1/1) ... [2022-12-13 17:49:02,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:49:02,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:49:02,593 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 17:49:02,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 17:49:02,634 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-12-13 17:49:02,634 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-12-13 17:49:02,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 17:49:02,634 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-12-13 17:49:02,634 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-12-13 17:49:02,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2022-12-13 17:49:02,635 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2022-12-13 17:49:02,635 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2022-12-13 17:49:02,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-12-13 17:49:02,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-12-13 17:49:02,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 17:49:02,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-12-13 17:49:02,635 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-12-13 17:49:02,636 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-12-13 17:49:02,636 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-12-13 17:49:02,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-13 17:49:02,636 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-13 17:49:02,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 17:49:02,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 17:49:02,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 17:49:02,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 17:49:02,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 17:49:02,637 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-12-13 17:49:02,637 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-12-13 17:49:02,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-12-13 17:49:02,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-12-13 17:49:02,637 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2022-12-13 17:49:02,638 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2022-12-13 17:49:02,638 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 17:49:02,638 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 17:49:02,638 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2022-12-13 17:49:02,638 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2022-12-13 17:49:02,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 17:49:02,638 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-12-13 17:49:02,638 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-12-13 17:49:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 17:49:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_new_from_array [2022-12-13 17:49:02,639 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_new_from_array [2022-12-13 17:49:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-12-13 17:49:02,639 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-12-13 17:49:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-12-13 17:49:02,639 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-12-13 17:49:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-12-13 17:49:02,640 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-12-13 17:49:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 17:49:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2022-12-13 17:49:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 17:49:02,853 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 17:49:02,855 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 17:49:02,979 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !true; [2022-12-13 17:49:03,709 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 17:49:03,714 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 17:49:03,715 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 17:49:03,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:49:03 BoogieIcfgContainer [2022-12-13 17:49:03,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 17:49:03,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 17:49:03,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 17:49:03,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 17:49:03,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:49:00" (1/3) ... [2022-12-13 17:49:03,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f686dc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:49:03, skipping insertion in model container [2022-12-13 17:49:03,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:49:02" (2/3) ... [2022-12-13 17:49:03,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f686dc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:49:03, skipping insertion in model container [2022-12-13 17:49:03,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:49:03" (3/3) ... [2022-12-13 17:49:03,723 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_string_new_from_c_str_harness.i [2022-12-13 17:49:03,736 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 17:49:03,736 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 17:49:03,779 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 17:49:03,784 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;@260a679f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 17:49:03,784 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 17:49:03,788 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 86 states have internal predecessors, (100), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-12-13 17:49:03,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-12-13 17:49:03,796 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:49:03,796 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:49:03,797 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:49:03,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:49:03,801 INFO L85 PathProgramCache]: Analyzing trace with hash -555983859, now seen corresponding path program 1 times [2022-12-13 17:49:03,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:49:03,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234920484] [2022-12-13 17:49:03,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:49:03,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:49:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:04,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:49:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:04,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:49:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:04,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:49:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:04,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:04,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:49:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:04,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 17:49:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:04,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 17:49:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:04,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 17:49:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:04,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:04,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 17:49:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:04,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:49:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:04,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-13 17:49:04,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:49:04,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234920484] [2022-12-13 17:49:04,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234920484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:49:04,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:49:04,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:49:04,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757604896] [2022-12-13 17:49:04,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:49:04,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:49:04,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:49:04,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:49:04,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:49:04,400 INFO L87 Difference]: Start difference. First operand has 136 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 86 states have internal predecessors, (100), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 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 17:49:04,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:49:04,801 INFO L93 Difference]: Finished difference Result 283 states and 370 transitions. [2022-12-13 17:49:04,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:49:04,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 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 74 [2022-12-13 17:49:04,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:49:04,809 INFO L225 Difference]: With dead ends: 283 [2022-12-13 17:49:04,809 INFO L226 Difference]: Without dead ends: 147 [2022-12-13 17:49:04,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 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 17:49:04,814 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 102 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 17:49:04,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 146 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 17:49:04,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-12-13 17:49:04,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 130. [2022-12-13 17:49:04,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 80 states have (on average 1.15) internal successors, (92), 81 states have internal predecessors, (92), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-12-13 17:49:04,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2022-12-13 17:49:04,864 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 74 [2022-12-13 17:49:04,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:49:04,865 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2022-12-13 17:49:04,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 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 17:49:04,866 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2022-12-13 17:49:04,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-12-13 17:49:04,868 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:49:04,868 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:49:04,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 17:49:04,869 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:49:04,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:49:04,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1001240943, now seen corresponding path program 1 times [2022-12-13 17:49:04,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:49:04,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454414966] [2022-12-13 17:49:04,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:49:04,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:49:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:05,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:49:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:05,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:49:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:05,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:49:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:05,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:05,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:49:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:05,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 17:49:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:05,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 17:49:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:05,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 17:49:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:05,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:05,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 17:49:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:05,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:49:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:05,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:05,365 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-13 17:49:05,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:49:05,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454414966] [2022-12-13 17:49:05,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454414966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:49:05,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:49:05,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:49:05,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414731351] [2022-12-13 17:49:05,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:49:05,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:49:05,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:49:05,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:49:05,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:49:05,368 INFO L87 Difference]: Start difference. First operand 130 states and 159 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 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 17:49:05,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:49:05,983 INFO L93 Difference]: Finished difference Result 196 states and 238 transitions. [2022-12-13 17:49:05,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:49:05,983 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 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 74 [2022-12-13 17:49:05,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:49:05,985 INFO L225 Difference]: With dead ends: 196 [2022-12-13 17:49:05,986 INFO L226 Difference]: Without dead ends: 152 [2022-12-13 17:49:05,986 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 17:49:05,987 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 104 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 17:49:05,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 330 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 17:49:05,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-12-13 17:49:06,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 135. [2022-12-13 17:49:06,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 85 states have internal predecessors, (96), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (34), 34 states have call predecessors, (34), 33 states have call successors, (34) [2022-12-13 17:49:06,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 164 transitions. [2022-12-13 17:49:06,006 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 164 transitions. Word has length 74 [2022-12-13 17:49:06,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:49:06,007 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 164 transitions. [2022-12-13 17:49:06,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 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 17:49:06,007 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 164 transitions. [2022-12-13 17:49:06,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 17:49:06,009 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:49:06,009 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:49:06,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 17:49:06,010 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:49:06,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:49:06,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1994019405, now seen corresponding path program 1 times [2022-12-13 17:49:06,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:49:06,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693270153] [2022-12-13 17:49:06,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:49:06,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:49:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:06,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:49:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:06,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:49:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:06,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:49:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:06,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:06,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:49:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:06,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 17:49:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:06,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 17:49:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:06,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 17:49:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:06,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:06,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 17:49:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:06,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:49:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:06,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:06,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 17:49:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-13 17:49:06,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:49:06,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693270153] [2022-12-13 17:49:06,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693270153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:49:06,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:49:06,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 17:49:06,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723787189] [2022-12-13 17:49:06,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:49:06,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 17:49:06,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:49:06,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 17:49:06,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:49:06,515 INFO L87 Difference]: Start difference. First operand 135 states and 164 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 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 17:49:07,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:49:07,232 INFO L93 Difference]: Finished difference Result 217 states and 267 transitions. [2022-12-13 17:49:07,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 17:49:07,233 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 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 80 [2022-12-13 17:49:07,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:49:07,234 INFO L225 Difference]: With dead ends: 217 [2022-12-13 17:49:07,234 INFO L226 Difference]: Without dead ends: 178 [2022-12-13 17:49:07,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-13 17:49:07,235 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 188 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:49:07,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 415 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 17:49:07,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-12-13 17:49:07,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 140. [2022-12-13 17:49:07,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 89 states have internal predecessors, (100), 34 states have call successors, (34), 15 states have call predecessors, (34), 17 states have return successors, (35), 35 states have call predecessors, (35), 33 states have call successors, (35) [2022-12-13 17:49:07,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 169 transitions. [2022-12-13 17:49:07,246 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 169 transitions. Word has length 80 [2022-12-13 17:49:07,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:49:07,247 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 169 transitions. [2022-12-13 17:49:07,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 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 17:49:07,247 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 169 transitions. [2022-12-13 17:49:07,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-12-13 17:49:07,248 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:49:07,248 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:49:07,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 17:49:07,248 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:49:07,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:49:07,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1920697878, now seen corresponding path program 1 times [2022-12-13 17:49:07,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:49:07,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394139705] [2022-12-13 17:49:07,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:49:07,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:49:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:08,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:49:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:08,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:49:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:08,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:49:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:08,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:08,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:49:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:08,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 17:49:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:08,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 17:49:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:08,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 17:49:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:08,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:08,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 17:49:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:08,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:49:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:08,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:08,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 17:49:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:08,212 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-13 17:49:08,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:49:08,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394139705] [2022-12-13 17:49:08,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394139705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:49:08,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:49:08,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-13 17:49:08,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912519099] [2022-12-13 17:49:08,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:49:08,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 17:49:08,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:49:08,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 17:49:08,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-12-13 17:49:08,215 INFO L87 Difference]: Start difference. First operand 140 states and 169 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2022-12-13 17:49:09,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:49:09,411 INFO L93 Difference]: Finished difference Result 178 states and 219 transitions. [2022-12-13 17:49:09,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 17:49:09,412 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 82 [2022-12-13 17:49:09,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:49:09,413 INFO L225 Difference]: With dead ends: 178 [2022-12-13 17:49:09,413 INFO L226 Difference]: Without dead ends: 161 [2022-12-13 17:49:09,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2022-12-13 17:49:09,415 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 193 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:49:09,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 691 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-13 17:49:09,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-12-13 17:49:09,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 126. [2022-12-13 17:49:09,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 78 states have internal predecessors, (86), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-12-13 17:49:09,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 151 transitions. [2022-12-13 17:49:09,433 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 151 transitions. Word has length 82 [2022-12-13 17:49:09,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:49:09,434 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 151 transitions. [2022-12-13 17:49:09,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2022-12-13 17:49:09,434 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 151 transitions. [2022-12-13 17:49:09,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-12-13 17:49:09,436 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:49:09,436 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2022-12-13 17:49:09,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 17:49:09,436 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:49:09,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:49:09,437 INFO L85 PathProgramCache]: Analyzing trace with hash -870191708, now seen corresponding path program 1 times [2022-12-13 17:49:09,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:49:09,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45248070] [2022-12-13 17:49:09,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:49:09,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:49:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:09,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:49:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:09,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:49:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:09,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:49:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:09,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:09,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:49:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:09,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 17:49:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:09,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 17:49:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:09,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:49:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:09,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 17:49:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:09,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:49:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:09,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:09,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 17:49:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:09,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:09,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:09,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:49:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:09,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:49:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:09,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 17:49:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:10,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:10,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 17:49:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:10,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-12-13 17:49:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:10,098 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-12-13 17:49:10,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:49:10,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45248070] [2022-12-13 17:49:10,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45248070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:49:10,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:49:10,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 17:49:10,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219520778] [2022-12-13 17:49:10,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:49:10,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 17:49:10,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:49:10,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 17:49:10,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:49:10,101 INFO L87 Difference]: Start difference. First operand 126 states and 151 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 5 states have internal predecessors, (58), 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 17:49:10,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:49:10,930 INFO L93 Difference]: Finished difference Result 206 states and 249 transitions. [2022-12-13 17:49:10,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 17:49:10,930 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 5 states have internal predecessors, (58), 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 123 [2022-12-13 17:49:10,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:49:10,931 INFO L225 Difference]: With dead ends: 206 [2022-12-13 17:49:10,932 INFO L226 Difference]: Without dead ends: 151 [2022-12-13 17:49:10,932 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 17:49:10,933 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 171 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:49:10,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 412 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 17:49:10,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-12-13 17:49:10,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 131. [2022-12-13 17:49:10,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 81 states have (on average 1.1111111111111112) internal successors, (90), 82 states have internal predecessors, (90), 33 states have call successors, (33), 15 states have call predecessors, (33), 16 states have return successors, (33), 33 states have call predecessors, (33), 32 states have call successors, (33) [2022-12-13 17:49:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 156 transitions. [2022-12-13 17:49:10,942 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 156 transitions. Word has length 123 [2022-12-13 17:49:10,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:49:10,943 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 156 transitions. [2022-12-13 17:49:10,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 5 states have internal predecessors, (58), 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 17:49:10,943 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 156 transitions. [2022-12-13 17:49:10,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-12-13 17:49:10,944 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:49:10,944 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1] [2022-12-13 17:49:10,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 17:49:10,944 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:49:10,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:49:10,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1724885987, now seen corresponding path program 1 times [2022-12-13 17:49:10,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:49:10,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967694649] [2022-12-13 17:49:10,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:49:10,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:49:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:11,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:49:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:11,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:49:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:11,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:49:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:11,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:11,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:49:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:11,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 17:49:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:11,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 17:49:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:11,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:49:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:11,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 17:49:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:11,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:49:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:11,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:11,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 17:49:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:11,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:11,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:11,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:49:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:11,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:49:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:11,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 17:49:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:11,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:11,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 17:49:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:11,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-12-13 17:49:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:11,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 17:49:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:11,653 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-12-13 17:49:11,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:49:11,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967694649] [2022-12-13 17:49:11,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967694649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:49:11,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:49:11,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 17:49:11,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408280885] [2022-12-13 17:49:11,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:49:11,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 17:49:11,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:49:11,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 17:49:11,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-13 17:49:11,656 INFO L87 Difference]: Start difference. First operand 131 states and 156 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 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 17:49:12,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:49:12,494 INFO L93 Difference]: Finished difference Result 212 states and 257 transitions. [2022-12-13 17:49:12,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 17:49:12,495 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 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 129 [2022-12-13 17:49:12,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:49:12,496 INFO L225 Difference]: With dead ends: 212 [2022-12-13 17:49:12,496 INFO L226 Difference]: Without dead ends: 143 [2022-12-13 17:49:12,497 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 17:49:12,497 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 291 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:49:12,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 409 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 17:49:12,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-12-13 17:49:12,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 124. [2022-12-13 17:49:12,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 77 states have internal predecessors, (83), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-12-13 17:49:12,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 146 transitions. [2022-12-13 17:49:12,505 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 146 transitions. Word has length 129 [2022-12-13 17:49:12,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:49:12,505 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 146 transitions. [2022-12-13 17:49:12,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 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 17:49:12,506 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 146 transitions. [2022-12-13 17:49:12,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-12-13 17:49:12,507 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:49:12,507 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2022-12-13 17:49:12,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 17:49:12,507 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:49:12,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:49:12,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1745997560, now seen corresponding path program 1 times [2022-12-13 17:49:12,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:49:12,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238064206] [2022-12-13 17:49:12,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:49:12,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:49:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:14,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:49:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:14,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:49:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:14,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:49:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:14,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:14,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:49:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:14,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 17:49:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:14,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 17:49:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:14,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:49:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:14,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 17:49:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:14,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:49:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:14,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:14,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 17:49:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:14,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:14,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:14,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:49:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:14,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:49:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:14,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 17:49:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:14,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:14,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 17:49:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:14,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:14,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 17:49:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:14,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 17:49:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:14,805 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-12-13 17:49:14,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:49:14,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238064206] [2022-12-13 17:49:14,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238064206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:49:14,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:49:14,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-12-13 17:49:14,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093217354] [2022-12-13 17:49:14,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:49:14,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 17:49:14,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:49:14,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 17:49:14,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2022-12-13 17:49:14,808 INFO L87 Difference]: Start difference. First operand 124 states and 146 transitions. Second operand has 22 states, 20 states have (on average 3.25) internal successors, (65), 17 states have internal predecessors, (65), 8 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2022-12-13 17:49:16,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:49:16,937 INFO L93 Difference]: Finished difference Result 190 states and 229 transitions. [2022-12-13 17:49:16,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 17:49:16,937 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.25) internal successors, (65), 17 states have internal predecessors, (65), 8 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) Word has length 134 [2022-12-13 17:49:16,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:49:16,938 INFO L225 Difference]: With dead ends: 190 [2022-12-13 17:49:16,938 INFO L226 Difference]: Without dead ends: 143 [2022-12-13 17:49:16,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=1388, Unknown=0, NotChecked=0, Total=1560 [2022-12-13 17:49:16,940 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 94 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 1833 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 1883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:49:16,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1034 Invalid, 1883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1833 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-12-13 17:49:16,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-12-13 17:49:16,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2022-12-13 17:49:16,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 88 states have internal predecessors, (93), 34 states have call successors, (34), 15 states have call predecessors, (34), 17 states have return successors, (35), 33 states have call predecessors, (35), 33 states have call successors, (35) [2022-12-13 17:49:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 162 transitions. [2022-12-13 17:49:16,955 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 162 transitions. Word has length 134 [2022-12-13 17:49:16,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:49:16,955 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 162 transitions. [2022-12-13 17:49:16,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.25) internal successors, (65), 17 states have internal predecessors, (65), 8 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2022-12-13 17:49:16,956 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 162 transitions. [2022-12-13 17:49:16,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-12-13 17:49:16,957 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:49:16,957 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1] [2022-12-13 17:49:16,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 17:49:16,958 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:49:16,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:49:16,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1524709556, now seen corresponding path program 1 times [2022-12-13 17:49:16,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:49:16,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001131149] [2022-12-13 17:49:16,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:49:16,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:49:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:17,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:49:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:17,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:49:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:17,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:49:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:17,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:17,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:49:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:17,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 17:49:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:17,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 17:49:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:17,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:49:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:17,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 17:49:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:17,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:49:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:17,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:17,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 17:49:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:17,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 17:49:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:17,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:17,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:17,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:49:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:17,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:49:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:17,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 17:49:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:17,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:17,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 17:49:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:17,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:17,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-12-13 17:49:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:17,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-12-13 17:49:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:17,372 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-12-13 17:49:17,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:49:17,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001131149] [2022-12-13 17:49:17,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001131149] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:49:17,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:49:17,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 17:49:17,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326886632] [2022-12-13 17:49:17,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:49:17,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 17:49:17,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:49:17,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 17:49:17,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-13 17:49:17,374 INFO L87 Difference]: Start difference. First operand 137 states and 162 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 6 states have internal predecessors, (63), 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 17:49:18,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:49:18,265 INFO L93 Difference]: Finished difference Result 225 states and 261 transitions. [2022-12-13 17:49:18,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 17:49:18,266 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 6 states have internal predecessors, (63), 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 17:49:18,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:49:18,267 INFO L225 Difference]: With dead ends: 225 [2022-12-13 17:49:18,267 INFO L226 Difference]: Without dead ends: 119 [2022-12-13 17:49:18,267 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 17:49:18,268 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 103 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 17:49:18,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 425 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 17:49:18,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-12-13 17:49:18,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-12-13 17:49:18,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 73 states have (on average 1.082191780821918) internal successors, (79), 74 states have internal predecessors, (79), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-12-13 17:49:18,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2022-12-13 17:49:18,276 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 140 [2022-12-13 17:49:18,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:49:18,276 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2022-12-13 17:49:18,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 6 states have internal predecessors, (63), 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 17:49:18,276 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2022-12-13 17:49:18,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-13 17:49:18,277 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:49:18,277 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2022-12-13 17:49:18,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 17:49:18,278 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:49:18,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:49:18,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1517224244, now seen corresponding path program 1 times [2022-12-13 17:49:18,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:49:18,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815772118] [2022-12-13 17:49:18,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:49:18,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:49:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:18,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:49:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:18,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:49:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:18,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:49:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:18,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:18,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:49:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:18,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 17:49:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:18,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 17:49:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:18,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:49:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:18,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 17:49:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:18,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:49:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:18,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:18,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 17:49:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:18,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:18,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:18,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:49:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:18,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:49:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:18,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 17:49:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:18,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:18,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 17:49:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:18,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:18,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 17:49:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:18,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-12-13 17:49:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:18,864 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-12-13 17:49:18,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:49:18,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815772118] [2022-12-13 17:49:18,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815772118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:49:18,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:49:18,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 17:49:18,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614803811] [2022-12-13 17:49:18,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:49:18,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:49:18,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:49:18,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:49:18,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:49:18,867 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 4 states have internal predecessors, (60), 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 17:49:19,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:49:19,460 INFO L93 Difference]: Finished difference Result 166 states and 196 transitions. [2022-12-13 17:49:19,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:49:19,461 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 4 states have internal predecessors, (60), 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 135 [2022-12-13 17:49:19,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:49:19,462 INFO L225 Difference]: With dead ends: 166 [2022-12-13 17:49:19,462 INFO L226 Difference]: Without dead ends: 120 [2022-12-13 17:49:19,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 17:49:19,463 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 123 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 17:49:19,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 249 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 17:49:19,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-12-13 17:49:19,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-12-13 17:49:19,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 75 states have internal predecessors, (80), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-12-13 17:49:19,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2022-12-13 17:49:19,470 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 141 transitions. Word has length 135 [2022-12-13 17:49:19,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:49:19,470 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 141 transitions. [2022-12-13 17:49:19,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 4 states have internal predecessors, (60), 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 17:49:19,471 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2022-12-13 17:49:19,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-12-13 17:49:19,471 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:49:19,471 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2022-12-13 17:49:19,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 17:49:19,472 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:49:19,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:49:19,472 INFO L85 PathProgramCache]: Analyzing trace with hash -473758278, now seen corresponding path program 1 times [2022-12-13 17:49:19,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:49:19,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236355527] [2022-12-13 17:49:19,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:49:19,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:49:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:20,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:49:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:20,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:49:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:20,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:49:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:20,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:20,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:49:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:20,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 17:49:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:20,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 17:49:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:20,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:49:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:20,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 17:49:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:20,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:49:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:21,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:21,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 17:49:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:21,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:21,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:21,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:49:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:21,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:49:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:21,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 17:49:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:21,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:21,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 17:49:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:21,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:21,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 17:49:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:21,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-12-13 17:49:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-12-13 17:49:21,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:49:21,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236355527] [2022-12-13 17:49:21,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236355527] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:49:21,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236213950] [2022-12-13 17:49:21,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:49:21,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:49:21,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:49:21,556 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:49:21,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 17:49:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:22,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 2930 conjuncts, 118 conjunts are in the unsatisfiable core [2022-12-13 17:49:22,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:49:22,613 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 17:49:23,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:49:23,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:49:23,343 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-13 17:49:23,343 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 26 treesize of output 33 [2022-12-13 17:49:23,412 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 17:49:23,413 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 17:49:24,226 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-12-13 17:49:24,226 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 17:49:24,348 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-12-13 17:49:24,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:49:26,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236213950] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:49:26,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:49:26,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 37] total 57 [2022-12-13 17:49:26,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88325989] [2022-12-13 17:49:26,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:49:26,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-12-13 17:49:26,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:49:26,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-12-13 17:49:26,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=4118, Unknown=2, NotChecked=0, Total=4290 [2022-12-13 17:49:26,413 INFO L87 Difference]: Start difference. First operand 120 states and 141 transitions. Second operand has 57 states, 50 states have (on average 2.48) internal successors, (124), 42 states have internal predecessors, (124), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) [2022-12-13 17:49:35,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:49:35,050 INFO L93 Difference]: Finished difference Result 174 states and 206 transitions. [2022-12-13 17:49:35,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-13 17:49:35,050 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 50 states have (on average 2.48) internal successors, (124), 42 states have internal predecessors, (124), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) Word has length 136 [2022-12-13 17:49:35,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:49:35,052 INFO L225 Difference]: With dead ends: 174 [2022-12-13 17:49:35,052 INFO L226 Difference]: Without dead ends: 123 [2022-12-13 17:49:35,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1877 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=515, Invalid=9781, Unknown=6, NotChecked=0, Total=10302 [2022-12-13 17:49:35,056 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 280 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 4753 mSolverCounterSat, 210 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 4968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 4753 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-12-13 17:49:35,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 1341 Invalid, 4968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 4753 Invalid, 5 Unknown, 0 Unchecked, 6.8s Time] [2022-12-13 17:49:35,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-12-13 17:49:35,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2022-12-13 17:49:35,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 75 states have (on average 1.08) internal successors, (81), 76 states have internal predecessors, (81), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-12-13 17:49:35,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2022-12-13 17:49:35,063 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 142 transitions. Word has length 136 [2022-12-13 17:49:35,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:49:35,063 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 142 transitions. [2022-12-13 17:49:35,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 50 states have (on average 2.48) internal successors, (124), 42 states have internal predecessors, (124), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) [2022-12-13 17:49:35,064 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 142 transitions. [2022-12-13 17:49:35,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-13 17:49:35,064 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:49:35,064 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2022-12-13 17:49:35,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 17:49:35,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 17:49:35,266 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:49:35,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:49:35,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1103785842, now seen corresponding path program 2 times [2022-12-13 17:49:35,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:49:35,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713559352] [2022-12-13 17:49:35,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:49:35,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:49:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:36,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:49:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:36,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:49:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:36,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:49:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:36,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:36,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:49:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:36,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 17:49:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:36,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 17:49:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:36,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:49:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:36,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 17:49:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:36,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:49:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:36,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:36,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 17:49:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:37,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:37,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:37,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:49:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:37,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:49:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:37,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 17:49:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:37,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:37,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 17:49:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:37,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:49:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:37,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 17:49:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:37,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-12-13 17:49:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:49:37,523 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-12-13 17:49:37,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:49:37,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713559352] [2022-12-13 17:49:37,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713559352] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:49:37,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644415666] [2022-12-13 17:49:37,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:49:37,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:49:37,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:49:37,524 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:49:37,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 17:49:40,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 17:49:40,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:49:40,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 3061 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-13 17:49:40,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:49:41,042 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 17:49:41,179 WARN L859 $PredicateComparison]: unable to prove that (exists ((|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_11_67| Int) (v_ArrVal_1285 Int) (v_ArrVal_1279 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_11_67| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_11_67|))) (and (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_11_67|) (<= 1 (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_11_67| .cse0)) (= |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_1279) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_11_67| |c_#Ultimate.C_memcpy_dest.offset| .cse0) v_ArrVal_1285))) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_11_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616))))) is different from true [2022-12-13 17:49:41,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:49:41,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:49:41,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:49:41,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 32 [2022-12-13 17:49:41,593 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 17:49:41,593 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 17:49:42,312 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-12-13 17:49:42,312 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 17:49:42,437 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 150 trivial. 2 not checked. [2022-12-13 17:49:42,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:49:44,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644415666] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:49:44,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:49:44,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 50 [2022-12-13 17:49:44,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634042795] [2022-12-13 17:49:44,597 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:49:44,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-12-13 17:49:44,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:49:44,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-12-13 17:49:44,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=3162, Unknown=4, NotChecked=112, Total=3422 [2022-12-13 17:49:44,598 INFO L87 Difference]: Start difference. First operand 121 states and 142 transitions. Second operand has 50 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 37 states have internal predecessors, (107), 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 17:49:53,501 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 17:50:01,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:50:01,049 INFO L93 Difference]: Finished difference Result 173 states and 205 transitions. [2022-12-13 17:50:01,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-13 17:50:01,050 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 37 states have internal predecessors, (107), 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 137 [2022-12-13 17:50:01,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:50:01,051 INFO L225 Difference]: With dead ends: 173 [2022-12-13 17:50:01,051 INFO L226 Difference]: Without dead ends: 122 [2022-12-13 17:50:01,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=337, Invalid=6633, Unknown=6, NotChecked=164, Total=7140 [2022-12-13 17:50:01,053 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 167 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 3863 mSolverCounterSat, 121 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 1557 SdHoareTripleChecker+Invalid, 4139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 3863 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:50:01,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 1557 Invalid, 4139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 3863 Invalid, 13 Unknown, 142 Unchecked, 11.0s Time] [2022-12-13 17:50:01,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-12-13 17:50:01,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-12-13 17:50:01,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 77 states have internal predecessors, (82), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-12-13 17:50:01,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 143 transitions. [2022-12-13 17:50:01,060 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 143 transitions. Word has length 137 [2022-12-13 17:50:01,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:50:01,060 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 143 transitions. [2022-12-13 17:50:01,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 37 states have internal predecessors, (107), 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 17:50:01,061 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 143 transitions. [2022-12-13 17:50:01,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-12-13 17:50:01,061 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:50:01,061 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 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] [2022-12-13 17:50:01,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 17:50:01,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 17:50:01,263 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:50:01,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:50:01,265 INFO L85 PathProgramCache]: Analyzing trace with hash 840196154, now seen corresponding path program 3 times [2022-12-13 17:50:01,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:50:01,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989333402] [2022-12-13 17:50:01,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:50:01,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:50:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:02,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:50:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:02,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:50:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:02,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:50:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:02,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:50:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:02,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:02,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 17:50:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:02,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 17:50:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:02,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:50:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:02,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 17:50:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:02,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:50:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:03,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:50:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:03,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 17:50:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:03,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:50:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:03,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:50:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:03,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:03,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:50:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:03,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 17:50:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:03,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:50:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:03,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 17:50:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:03,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:50:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:03,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 17:50:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:03,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-12-13 17:50:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:03,790 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-12-13 17:50:03,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:50:03,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989333402] [2022-12-13 17:50:03,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989333402] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:50:03,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657379378] [2022-12-13 17:50:03,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 17:50:03,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:50:03,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:50:03,791 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:50:03,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 17:50:07,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 17:50:07,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:50:07,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 2864 conjuncts, 79 conjunts are in the unsatisfiable core [2022-12-13 17:50:07,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:50:07,383 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 17:50:07,537 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_20| Int) (v_ArrVal_1958 Int) (v_ArrVal_1953 Int)) (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|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_1953) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_20| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1958)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_20| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_20|))) (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616))) is different from true [2022-12-13 17:50:07,553 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_20| Int) (v_ArrVal_1958 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_21| Int) (v_ArrVal_1960 Int) (v_ArrVal_1953 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_20| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_21|) (= |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_1953) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_20| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1958) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_21| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_1960))) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_20|))) (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616))) is different from true [2022-12-13 17:50:07,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:50:07,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:50:07,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:50:07,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:50:07,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:50:07,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:50:07,949 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 34 treesize of output 38 [2022-12-13 17:50:08,021 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 17:50:08,021 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 17:50:08,763 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-12-13 17:50:08,764 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 17:50:08,879 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 150 trivial. 5 not checked. [2022-12-13 17:50:08,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:50:12,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657379378] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:50:12,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:50:12,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 29] total 52 [2022-12-13 17:50:12,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079837146] [2022-12-13 17:50:12,031 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:50:12,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-12-13 17:50:12,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:50:12,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-12-13 17:50:12,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=3280, Unknown=2, NotChecked=230, Total=3660 [2022-12-13 17:50:12,033 INFO L87 Difference]: Start difference. First operand 122 states and 143 transitions. Second operand has 52 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 39 states have internal predecessors, (109), 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 17:50:28,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:50:28,363 INFO L93 Difference]: Finished difference Result 174 states and 206 transitions. [2022-12-13 17:50:28,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-13 17:50:28,364 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 39 states have internal predecessors, (109), 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 138 [2022-12-13 17:50:28,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:50:28,365 INFO L225 Difference]: With dead ends: 174 [2022-12-13 17:50:28,365 INFO L226 Difference]: Without dead ends: 123 [2022-12-13 17:50:28,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=346, Invalid=6969, Unknown=3, NotChecked=338, Total=7656 [2022-12-13 17:50:28,368 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 147 mSDsluCounter, 1561 mSDsCounter, 0 mSdLazyCounter, 4099 mSolverCounterSat, 92 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 4497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 4099 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 290 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2022-12-13 17:50:28,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1620 Invalid, 4497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 4099 Invalid, 16 Unknown, 290 Unchecked, 12.6s Time] [2022-12-13 17:50:28,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-12-13 17:50:28,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-12-13 17:50:28,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 77 states have (on average 1.077922077922078) internal successors, (83), 78 states have internal predecessors, (83), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-12-13 17:50:28,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2022-12-13 17:50:28,376 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 138 [2022-12-13 17:50:28,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:50:28,376 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2022-12-13 17:50:28,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 39 states have internal predecessors, (109), 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 17:50:28,376 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2022-12-13 17:50:28,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-12-13 17:50:28,377 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:50:28,377 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 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] [2022-12-13 17:50:28,388 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 17:50:28,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 17:50:28,578 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:50:28,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:50:28,579 INFO L85 PathProgramCache]: Analyzing trace with hash 974095886, now seen corresponding path program 4 times [2022-12-13 17:50:28,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:50:28,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084333458] [2022-12-13 17:50:28,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:50:28,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:50:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:30,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:50:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:30,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:50:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:30,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:50:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:30,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:50:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:30,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:50:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:30,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 17:50:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:30,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 17:50:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:30,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:50:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:30,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 17:50:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:30,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:50:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:30,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:50:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:30,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 17:50:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:30,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:50:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:30,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:50:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:30,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:50:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:30,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:50:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:30,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 17:50:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:30,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:50:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:30,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 17:50:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:30,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:50:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:30,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 17:50:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:31,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-12-13 17:50:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:50:31,186 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-12-13 17:50:31,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:50:31,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084333458] [2022-12-13 17:50:31,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084333458] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:50:31,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934480604] [2022-12-13 17:50:31,186 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 17:50:31,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:50:31,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:50:31,187 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:50:31,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 17:50:34,145 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 17:50:34,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:50:34,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 3323 conjuncts, 120 conjunts are in the unsatisfiable core [2022-12-13 17:50:34,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:50:34,662 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 17:50:35,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:50:35,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:50:35,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:50:35,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:50:35,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:50:35,813 INFO L321 Elim1Store]: treesize reduction 54, result has 48.6 percent of original size [2022-12-13 17:50:35,813 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 41 treesize of output 72 [2022-12-13 17:50:35,901 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 17:50:35,902 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 17:50:36,801 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-12-13 17:50:36,802 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 17:50:36,940 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-12-13 17:50:36,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:50:42,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934480604] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:50:42,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:50:42,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 40] total 63 [2022-12-13 17:50:42,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338188867] [2022-12-13 17:50:42,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:50:42,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-12-13 17:50:42,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:50:42,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-12-13 17:50:42,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=4927, Unknown=1, NotChecked=0, Total=5112 [2022-12-13 17:50:42,127 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand has 63 states, 56 states have (on average 2.3214285714285716) internal successors, (130), 48 states have internal predecessors, (130), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) [2022-12-13 17:51:04,807 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 17:51:05,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:51:05,892 INFO L93 Difference]: Finished difference Result 177 states and 209 transitions. [2022-12-13 17:51:05,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-13 17:51:05,892 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 56 states have (on average 2.3214285714285716) internal successors, (130), 48 states have internal predecessors, (130), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) Word has length 139 [2022-12-13 17:51:05,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:51:05,893 INFO L225 Difference]: With dead ends: 177 [2022-12-13 17:51:05,893 INFO L226 Difference]: Without dead ends: 126 [2022-12-13 17:51:05,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2273 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=552, Invalid=11655, Unknown=3, NotChecked=0, Total=12210 [2022-12-13 17:51:05,895 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 210 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 5462 mSolverCounterSat, 133 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 5600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 5462 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.4s IncrementalHoareTripleChecker+Time [2022-12-13 17:51:05,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 1450 Invalid, 5600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 5462 Invalid, 5 Unknown, 0 Unchecked, 19.4s Time] [2022-12-13 17:51:05,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-12-13 17:51:05,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2022-12-13 17:51:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 78 states have (on average 1.0769230769230769) internal successors, (84), 79 states have internal predecessors, (84), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-12-13 17:51:05,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 145 transitions. [2022-12-13 17:51:05,904 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 145 transitions. Word has length 139 [2022-12-13 17:51:05,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:51:05,904 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 145 transitions. [2022-12-13 17:51:05,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 56 states have (on average 2.3214285714285716) internal successors, (130), 48 states have internal predecessors, (130), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) [2022-12-13 17:51:05,904 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 145 transitions. [2022-12-13 17:51:05,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-12-13 17:51:05,905 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:51:05,905 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 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] [2022-12-13 17:51:05,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 17:51:06,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 17:51:06,107 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:51:06,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:51:06,108 INFO L85 PathProgramCache]: Analyzing trace with hash 830020282, now seen corresponding path program 5 times [2022-12-13 17:51:06,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:51:06,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066275949] [2022-12-13 17:51:06,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:51:06,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:51:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:08,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:51:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:08,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:51:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:08,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:51:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:08,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:51:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:08,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:51:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:08,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 17:51:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:08,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 17:51:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:08,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:51:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:08,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 17:51:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:08,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:51:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:08,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:51:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:08,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 17:51:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:08,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:51:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:08,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:51:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:08,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:51:08,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:08,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:51:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:08,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 17:51:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:08,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:51:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:08,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 17:51:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:08,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:51:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:08,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 17:51:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:09,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-12-13 17:51:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:09,193 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-12-13 17:51:09,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:51:09,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066275949] [2022-12-13 17:51:09,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066275949] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:51:09,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182720575] [2022-12-13 17:51:09,193 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 17:51:09,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:51:09,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:09,194 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:51:09,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 17:51:25,134 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-12-13 17:51:25,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:51:25,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 3454 conjuncts, 155 conjunts are in the unsatisfiable core [2022-12-13 17:51:25,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:51:25,961 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 17:51:26,094 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3848 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_43| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_43| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_43|) (= |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|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_43| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3848))))) is different from true [2022-12-13 17:51:26,107 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3848 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_44| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_43| Int) (v_ArrVal_3851 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_43| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_44|) (= (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~loopctr1316_43| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3848) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_44| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3851)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_44| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_43|))) is different from true [2022-12-13 17:51:26,146 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3858 Int) (v_ArrVal_3848 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_44| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_45_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_43| Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_45_67| Int) (v_ArrVal_3851 Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_45_67|))) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_44| 1) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_45_67| .cse0)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_43| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_44|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_45_67|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_45_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|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_43| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3848) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_44| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3851) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_45_67| .cse0 |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3858)) |c_#memory_int|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_43|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_45_67| .cse0 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|)))) is different from true [2022-12-13 17:51:26,191 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3858 Int) (v_ArrVal_3848 Int) (v_ArrVal_3859 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_44| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_45_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_43| Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_45_67| Int) (v_ArrVal_3851 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_46| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_45_67|))) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_44| 1) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_45_67| .cse0)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_43| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_44|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_45_67|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_45_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_43|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_45_67| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_46|) (= (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~loopctr1316_43| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3848) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_44| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3851) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_45_67| .cse0 |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3858) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_46| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3859)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_46| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|)))) is different from true [2022-12-13 17:51:26,246 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3858 Int) (v_ArrVal_3848 Int) (v_ArrVal_3859 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_44| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_45_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_43| Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_45_67| Int) (v_ArrVal_3864 Int) (v_ArrVal_3851 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_46| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_47| Int)) (let ((.cse0 (* 18446744073709551616 |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1316_45_67|))) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_44| 1) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_45_67| .cse0)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_43| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_44|) (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_45_67|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_45_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_43|) (<= (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_45_67| .cse0 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_46|) (= (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~loopctr1316_43| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3848) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_44| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3851) (+ |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1316_45_67| .cse0 |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3858) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_46| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3859) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_47| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3864)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_46| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_47|)))) is different from true [2022-12-13 17:51:27,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:51:27,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:51:27,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:51:27,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:51:27,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:51:27,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:51:27,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:51:27,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:51:27,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:51:27,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:51:27,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:51:27,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:51:27,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:51:27,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:51:27,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:51:27,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:51:27,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:51:27,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:51:27,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:51:27,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:51:27,266 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-13 17:51:27,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 20 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 72 [2022-12-13 17:51:27,370 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 17:51:27,370 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 17:51:28,292 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-12-13 17:51:28,292 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 17:51:28,464 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 126 trivial. 15 not checked. [2022-12-13 17:51:28,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:51:37,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182720575] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:51:37,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:51:37,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 44] total 70 [2022-12-13 17:51:37,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096443650] [2022-12-13 17:51:37,601 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:51:37,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-12-13 17:51:37,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:51:37,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-12-13 17:51:37,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=5223, Unknown=8, NotChecked=740, Total=6162 [2022-12-13 17:51:37,604 INFO L87 Difference]: Start difference. First operand 124 states and 145 transitions. Second operand has 70 states, 61 states have (on average 2.0163934426229506) internal successors, (123), 53 states have internal predecessors, (123), 17 states have call successors, (42), 10 states have call predecessors, (42), 15 states have return successors, (38), 21 states have call predecessors, (38), 16 states have call successors, (38) [2022-12-13 17:52:23,192 WARN L233 SmtUtils]: Spent 8.59s on a formula simplification. DAG size of input: 89 DAG size of output: 81 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:52:25,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:52:25,440 INFO L93 Difference]: Finished difference Result 178 states and 210 transitions. [2022-12-13 17:52:25,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-12-13 17:52:25,441 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 61 states have (on average 2.0163934426229506) internal successors, (123), 53 states have internal predecessors, (123), 17 states have call successors, (42), 10 states have call predecessors, (42), 15 states have return successors, (38), 21 states have call predecessors, (38), 16 states have call successors, (38) Word has length 140 [2022-12-13 17:52:25,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:52:25,441 INFO L225 Difference]: With dead ends: 178 [2022-12-13 17:52:25,441 INFO L226 Difference]: Without dead ends: 130 [2022-12-13 17:52:25,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2489 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=586, Invalid=13687, Unknown=27, NotChecked=1200, Total=15500 [2022-12-13 17:52:25,444 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 276 mSDsluCounter, 1700 mSDsCounter, 0 mSdLazyCounter, 6048 mSolverCounterSat, 189 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 6986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 6048 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 735 IncrementalHoareTripleChecker+Unchecked, 28.0s IncrementalHoareTripleChecker+Time [2022-12-13 17:52:25,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 1755 Invalid, 6986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 6048 Invalid, 14 Unknown, 735 Unchecked, 28.0s Time] [2022-12-13 17:52:25,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-12-13 17:52:25,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 125. [2022-12-13 17:52:25,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 79 states have (on average 1.0759493670886076) internal successors, (85), 80 states have internal predecessors, (85), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-12-13 17:52:25,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 146 transitions. [2022-12-13 17:52:25,461 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 146 transitions. Word has length 140 [2022-12-13 17:52:25,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:52:25,461 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 146 transitions. [2022-12-13 17:52:25,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 61 states have (on average 2.0163934426229506) internal successors, (123), 53 states have internal predecessors, (123), 17 states have call successors, (42), 10 states have call predecessors, (42), 15 states have return successors, (38), 21 states have call predecessors, (38), 16 states have call successors, (38) [2022-12-13 17:52:25,462 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 146 transitions. [2022-12-13 17:52:25,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-12-13 17:52:25,463 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:52:25,463 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 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] [2022-12-13 17:52:25,485 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 17:52:25,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:52:25,664 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:52:25,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:52:25,665 INFO L85 PathProgramCache]: Analyzing trace with hash -723622004, now seen corresponding path program 6 times [2022-12-13 17:52:25,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:52:25,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704385498] [2022-12-13 17:52:25,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:52:25,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:52:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:52:26,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:52:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:52:26,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:52:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:52:26,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:52:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:52:26,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:52:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:52:26,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:52:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:52:26,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 17:52:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:52:26,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 17:52:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:52:26,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:52:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:52:26,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 17:52:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:52:26,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:52:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:52:26,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:52:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:52:26,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 17:52:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:52:26,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:52:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:52:26,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:52:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:52:26,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:52:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:52:26,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:52:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:52:26,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 17:52:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:52:26,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:52:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:52:26,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 17:52:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:52:26,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:52:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:52:26,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 17:52:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:52:26,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-12-13 17:52:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:52:26,758 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-12-13 17:52:26,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:52:26,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704385498] [2022-12-13 17:52:26,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704385498] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:52:26,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062140587] [2022-12-13 17:52:26,758 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 17:52:26,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:52:26,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:52:26,759 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:52:26,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 17:52:59,668 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-12-13 17:52:59,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:52:59,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 3451 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 17:52:59,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:52:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-12-13 17:52:59,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:53:00,216 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-12-13 17:53:00,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062140587] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:53:00,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:53:00,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 11] total 26 [2022-12-13 17:53:00,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126465751] [2022-12-13 17:53:00,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:53:00,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 17:53:00,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:53:00,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 17:53:00,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2022-12-13 17:53:00,218 INFO L87 Difference]: Start difference. First operand 125 states and 146 transitions. Second operand has 26 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 22 states have internal predecessors, (92), 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 17:53:07,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:53:07,352 INFO L93 Difference]: Finished difference Result 184 states and 220 transitions. [2022-12-13 17:53:07,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 17:53:07,353 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 22 states have internal predecessors, (92), 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 141 [2022-12-13 17:53:07,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:53:07,354 INFO L225 Difference]: With dead ends: 184 [2022-12-13 17:53:07,354 INFO L226 Difference]: Without dead ends: 135 [2022-12-13 17:53:07,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 309 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=344, Invalid=1378, Unknown=0, NotChecked=0, Total=1722 [2022-12-13 17:53:07,355 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 183 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:53:07,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 620 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-12-13 17:53:07,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-12-13 17:53:07,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 130. [2022-12-13 17:53:07,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 84 states have (on average 1.1071428571428572) internal successors, (93), 85 states have internal predecessors, (93), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-12-13 17:53:07,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 154 transitions. [2022-12-13 17:53:07,369 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 154 transitions. Word has length 141 [2022-12-13 17:53:07,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:53:07,369 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 154 transitions. [2022-12-13 17:53:07,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 22 states have internal predecessors, (92), 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 17:53:07,370 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 154 transitions. [2022-12-13 17:53:07,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-12-13 17:53:07,370 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:53:07,370 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 3, 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] [2022-12-13 17:53:07,391 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 17:53:07,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 17:53:07,572 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:53:07,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:53:07,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1169084622, now seen corresponding path program 7 times [2022-12-13 17:53:07,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:53:07,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034175958] [2022-12-13 17:53:07,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:53:07,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:53:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:08,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:53:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:08,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:53:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:08,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:53:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:08,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:53:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:08,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:53:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:08,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 17:53:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:08,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 17:53:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:08,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:53:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:08,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 17:53:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:08,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:53:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:08,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:53:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:08,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 17:53:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:08,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:53:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:08,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:53:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:08,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:53:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:08,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:53:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:08,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 17:53:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:08,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:53:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:08,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 17:53:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:08,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:53:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:08,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 17:53:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:08,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-12-13 17:53:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:08,895 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-12-13 17:53:08,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:53:08,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034175958] [2022-12-13 17:53:08,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034175958] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:53:08,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714273372] [2022-12-13 17:53:08,896 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 17:53:08,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:53:08,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:53:08,897 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:53:08,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 17:53:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:53:13,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 3631 conjuncts, 151 conjunts are in the unsatisfiable core [2022-12-13 17:53:13,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:53:13,788 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 17:53:13,941 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_86| Int) (v_ArrVal_6139 Int) (v_ArrVal_6136 Int)) (and (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_86|) (= (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_6136) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_86| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6139)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_86| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|))) (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616))) is different from true [2022-12-13 17:53:13,961 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_86| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_87| Int) (v_ArrVal_6139 Int) (v_ArrVal_6136 Int) (v_ArrVal_6143 Int)) (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|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_6136) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_86| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6139) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_87| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6143)) |c_#memory_int|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_86|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_86| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_87|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_87| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|)))) is different from true [2022-12-13 17:53:13,989 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_86| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_88| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_87| Int) (v_ArrVal_6139 Int) (v_ArrVal_6148 Int) (v_ArrVal_6136 Int) (v_ArrVal_6143 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_87| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_88|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_86|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_86| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_87|) (= |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|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_6136) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_86| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6139) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_87| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6143) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_88| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6148))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_88| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|)))) is different from true [2022-12-13 17:53:14,025 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_86| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_88| Int) (v_ArrVal_6151 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_87| Int) (v_ArrVal_6139 Int) (v_ArrVal_6148 Int) (v_ArrVal_6136 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_89| Int) (v_ArrVal_6143 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_87| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_88|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_86|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_86| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_87|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_89| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (= (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_6136) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_86| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6139) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_87| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6143) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_88| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6148) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_89| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6151)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_88| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_89|)))) is different from true [2022-12-13 17:53:14,065 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_86| Int) (v_ArrVal_6153 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_88| Int) (v_ArrVal_6151 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_87| Int) (v_ArrVal_6139 Int) (v_ArrVal_6148 Int) (v_ArrVal_6136 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_90| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_89| Int) (v_ArrVal_6143 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_87| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_88|) (= (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_6136) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_86| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6139) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_87| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6143) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_88| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6148) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_89| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6151) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_90| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_6153)) |c_#memory_int|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_86|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_86| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_87|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_89| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_90|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_88| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_89|))) (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616))) is different from true [2022-12-13 17:53:15,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:15,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:15,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:15,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:15,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:15,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:15,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:15,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:15,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:15,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:15,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:15,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:15,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:15,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:15,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:15,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:15,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:15,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:15,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:15,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:53:15,581 INFO L321 Elim1Store]: treesize reduction 165, result has 34.3 percent of original size [2022-12-13 17:53:15,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 26 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 125 [2022-12-13 17:53:15,722 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 17:53:15,723 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 17:53:16,714 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-12-13 17:53:16,714 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 17:53:16,896 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 57 trivial. 20 not checked. [2022-12-13 17:53:16,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:53:38,985 WARN L233 SmtUtils]: Spent 14.08s on a formula simplification that was a NOOP. DAG size: 111 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:53:38,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714273372] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:53:38,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:53:38,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 45] total 58 [2022-12-13 17:53:38,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073834489] [2022-12-13 17:53:38,988 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:53:38,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-12-13 17:53:38,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:53:38,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-12-13 17:53:38,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3627, Unknown=5, NotChecked=620, Total=4422 [2022-12-13 17:53:38,990 INFO L87 Difference]: Start difference. First operand 130 states and 154 transitions. Second operand has 58 states, 53 states have (on average 2.3773584905660377) internal successors, (126), 44 states have internal predecessors, (126), 9 states have call successors, (38), 10 states have call predecessors, (38), 11 states have return successors, (33), 11 states have call predecessors, (33), 8 states have call successors, (33) [2022-12-13 17:54:17,720 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 17:54:27,586 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 17:54:33,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:54:33,433 INFO L93 Difference]: Finished difference Result 182 states and 215 transitions. [2022-12-13 17:54:33,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 17:54:33,434 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 53 states have (on average 2.3773584905660377) internal successors, (126), 44 states have internal predecessors, (126), 9 states have call successors, (38), 10 states have call predecessors, (38), 11 states have return successors, (33), 11 states have call predecessors, (33), 8 states have call successors, (33) Word has length 143 [2022-12-13 17:54:33,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:54:33,435 INFO L225 Difference]: With dead ends: 182 [2022-12-13 17:54:33,435 INFO L226 Difference]: Without dead ends: 132 [2022-12-13 17:54:33,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1362 ImplicationChecksByTransitivity, 37.7s TimeCoverageRelationStatistics Valid=421, Invalid=7958, Unknown=13, NotChecked=920, Total=9312 [2022-12-13 17:54:33,437 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 261 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 4990 mSolverCounterSat, 191 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 5921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 4990 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 733 IncrementalHoareTripleChecker+Unchecked, 35.5s IncrementalHoareTripleChecker+Time [2022-12-13 17:54:33,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 1352 Invalid, 5921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 4990 Invalid, 7 Unknown, 733 Unchecked, 35.5s Time] [2022-12-13 17:54:33,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-12-13 17:54:33,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2022-12-13 17:54:33,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 84 states have (on average 1.0952380952380953) internal successors, (92), 85 states have internal predecessors, (92), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-12-13 17:54:33,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 153 transitions. [2022-12-13 17:54:33,452 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 153 transitions. Word has length 143 [2022-12-13 17:54:33,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:54:33,452 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 153 transitions. [2022-12-13 17:54:33,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 53 states have (on average 2.3773584905660377) internal successors, (126), 44 states have internal predecessors, (126), 9 states have call successors, (38), 10 states have call predecessors, (38), 11 states have return successors, (33), 11 states have call predecessors, (33), 8 states have call successors, (33) [2022-12-13 17:54:33,452 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 153 transitions. [2022-12-13 17:54:33,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-12-13 17:54:33,453 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:54:33,453 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 3, 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] [2022-12-13 17:54:33,484 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 17:54:33,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 17:54:33,654 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:54:33,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:54:33,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1884934278, now seen corresponding path program 8 times [2022-12-13 17:54:33,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:54:33,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737479863] [2022-12-13 17:54:33,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:54:33,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:54:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:34,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:54:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:34,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:54:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:34,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:54:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:34,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:54:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:34,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:54:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:34,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 17:54:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:34,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 17:54:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:34,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:54:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:34,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 17:54:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:34,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:54:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:34,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:54:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:34,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 17:54:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:34,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:54:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:34,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:54:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:34,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:54:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:34,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:54:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:34,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 17:54:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:34,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:54:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:34,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 17:54:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:34,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:54:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:34,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 17:54:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:35,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-12-13 17:54:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-12-13 17:54:35,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:54:35,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737479863] [2022-12-13 17:54:35,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737479863] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:54:35,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589292346] [2022-12-13 17:54:35,291 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:54:35,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:54:35,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:54:35,292 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:54:35,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 17:54:51,160 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 17:54:51,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:54:51,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 3762 conjuncts, 107 conjunts are in the unsatisfiable core [2022-12-13 17:54:51,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:54:51,353 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 17:54:51,433 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1316_110| Int) (v_ArrVal_7601 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (= (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~loopctr1316_110| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7601)) |c_#memory_int|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_110|))) is different from true [2022-12-13 17:54:51,448 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7608 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_110| Int) (v_ArrVal_7601 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_111| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_111|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (= (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~loopctr1316_110| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7601) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7608)) |c_#memory_int|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_110|))) is different from true [2022-12-13 17:54:51,466 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7608 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_110| Int) (v_ArrVal_7601 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_111| Int) (v_ArrVal_7612 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_112| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_111|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (= |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|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7601) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7608) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7612))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_112|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_110|))) is different from true [2022-12-13 17:54:51,493 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7608 Int) (v_ArrVal_7615 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_110| Int) (v_ArrVal_7601 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_111| Int) (v_ArrVal_7612 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_112| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_113| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (= (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~loopctr1316_110| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7601) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7608) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7612) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7615)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_111|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_113|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_112|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_110|))) is different from true [2022-12-13 17:54:51,532 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7608 Int) (v_ArrVal_7615 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_110| Int) (v_ArrVal_7601 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_111| Int) (v_ArrVal_7612 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_112| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_113| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_114| Int) (v_ArrVal_7620 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_111|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_114| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (= |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|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7601) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7608) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7612) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7615) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_114| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7620))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_114|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_113|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_112|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_110|))) is different from true [2022-12-13 17:54:51,583 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7608 Int) (v_ArrVal_7615 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_110| Int) (v_ArrVal_7601 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_111| Int) (v_ArrVal_7612 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_112| Int) (v_ArrVal_7624 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_113| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_114| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_115| Int) (v_ArrVal_7620 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_115| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_114| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_115|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_111|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_114|) (= (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~loopctr1316_110| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7601) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7608) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7612) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7615) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_114| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7620) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_115| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7624)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_113|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_112|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_110|))) is different from true [2022-12-13 17:54:51,641 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7608 Int) (v_ArrVal_7615 Int) (v_ArrVal_7627 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_110| Int) (v_ArrVal_7601 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_111| Int) (v_ArrVal_7612 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_112| Int) (v_ArrVal_7624 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_113| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_114| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_115| Int) (v_ArrVal_7620 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_116| Int)) (and (= (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~loopctr1316_110| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7601) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7608) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7612) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7615) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_114| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7620) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_115| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7624) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_116| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7627)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_114| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_115|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_110| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_111|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_113| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_114|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_115| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_116|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_112| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_113|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_111| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_112|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1316_110|))) is different from true [2022-12-13 17:54:53,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:54:53,880 INFO L321 Elim1Store]: treesize reduction 237, result has 32.9 percent of original size [2022-12-13 17:54:53,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 40 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 66 treesize of output 153 [2022-12-13 17:54:54,051 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 17:54:54,051 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 35 treesize of output 31 [2022-12-13 17:54:55,083 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-12-13 17:54:55,084 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 95 treesize of output 61 [2022-12-13 17:54:55,299 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 150 trivial. 28 not checked. [2022-12-13 17:54:55,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:55:04,051 WARN L233 SmtUtils]: Spent 6.81s on a formula simplification that was a NOOP. DAG size: 190 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:55:14,006 WARN L233 SmtUtils]: Spent 6.32s on a formula simplification that was a NOOP. DAG size: 141 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:55:14,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589292346] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:55:14,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:55:14,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 35] total 49 [2022-12-13 17:55:14,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755294887] [2022-12-13 17:55:14,009 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:55:14,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-13 17:55:14,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:55:14,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-13 17:55:14,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2432, Unknown=8, NotChecked=728, Total=3306 [2022-12-13 17:55:14,010 INFO L87 Difference]: Start difference. First operand 130 states and 153 transitions. Second operand has 49 states, 46 states have (on average 2.347826086956522) internal successors, (108), 37 states have internal predecessors, (108), 5 states have call successors, (32), 9 states have call predecessors, (32), 7 states have return successors, (26), 7 states have call predecessors, (26), 4 states have call successors, (26) [2022-12-13 17:55:38,008 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 17:55:46,714 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 17:55:51,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:55:51,912 INFO L93 Difference]: Finished difference Result 180 states and 212 transitions. [2022-12-13 17:55:51,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 17:55:51,913 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 2.347826086956522) internal successors, (108), 37 states have internal predecessors, (108), 5 states have call successors, (32), 9 states have call predecessors, (32), 7 states have return successors, (26), 7 states have call predecessors, (26), 4 states have call successors, (26) Word has length 144 [2022-12-13 17:55:51,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:55:51,913 INFO L225 Difference]: With dead ends: 180 [2022-12-13 17:55:51,913 INFO L226 Difference]: Without dead ends: 130 [2022-12-13 17:55:51,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=236, Invalid=4337, Unknown=11, NotChecked=966, Total=5550 [2022-12-13 17:55:51,914 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 84 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 3367 mSolverCounterSat, 33 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 4428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3367 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 1023 IncrementalHoareTripleChecker+Unchecked, 29.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:55:51,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1377 Invalid, 4428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3367 Invalid, 5 Unknown, 1023 Unchecked, 29.7s Time] [2022-12-13 17:55:51,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-12-13 17:55:51,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-12-13 17:55:51,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 84 states have (on average 1.0833333333333333) internal successors, (91), 85 states have internal predecessors, (91), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-12-13 17:55:51,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2022-12-13 17:55:51,929 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 144 [2022-12-13 17:55:51,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:55:51,929 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2022-12-13 17:55:51,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 2.347826086956522) internal successors, (108), 37 states have internal predecessors, (108), 5 states have call successors, (32), 9 states have call predecessors, (32), 7 states have return successors, (26), 7 states have call predecessors, (26), 4 states have call successors, (26) [2022-12-13 17:55:51,929 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2022-12-13 17:55:51,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-12-13 17:55:51,930 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:55:51,930 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 3, 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] [2022-12-13 17:55:51,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 17:55:52,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 17:55:52,130 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:55:52,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:55:52,131 INFO L85 PathProgramCache]: Analyzing trace with hash -2070239666, now seen corresponding path program 9 times [2022-12-13 17:55:52,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:55:52,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301481087] [2022-12-13 17:55:52,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:55:52,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:55:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:53,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:55:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:53,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:55:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:53,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:55:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:53,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:55:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:53,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:55:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:53,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 17:55:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:53,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 17:55:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:53,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:55:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:53,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 17:55:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:53,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:55:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:53,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:55:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:53,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 17:55:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:53,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:55:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:53,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:55:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:53,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:55:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:53,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:55:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:53,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 17:55:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:53,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:55:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:53,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 17:55:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:53,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:55:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:53,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 17:55:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:53,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-12-13 17:55:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-12-13 17:55:53,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:55:53,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301481087] [2022-12-13 17:55:53,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301481087] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:55:53,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205120715] [2022-12-13 17:55:53,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 17:55:53,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:55:53,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:55:53,785 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:55:53,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 17:58:03,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 17:58:03,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:58:03,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 3479 conjuncts, 118 conjunts are in the unsatisfiable core [2022-12-13 17:58:03,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:58:03,618 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 17:58:03,668 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 17 treesize of output 9 [2022-12-13 17:58:04,363 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 40 proven. 24 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-13 17:58:04,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:58:06,394 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 70 treesize of output 62 [2022-12-13 17:58:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 46 proven. 6 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2022-12-13 17:58:06,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205120715] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:58:06,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:58:06,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 29, 24] total 65 [2022-12-13 17:58:06,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424722351] [2022-12-13 17:58:06,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:58:06,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-12-13 17:58:06,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:58:06,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-12-13 17:58:06,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=3962, Unknown=0, NotChecked=0, Total=4160 [2022-12-13 17:58:06,582 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand has 65 states, 57 states have (on average 2.56140350877193) internal successors, (146), 54 states have internal predecessors, (146), 19 states have call successors, (50), 7 states have call predecessors, (50), 13 states have return successors, (47), 21 states have call predecessors, (47), 18 states have call successors, (47) [2022-12-13 17:58:24,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:58:24,345 INFO L93 Difference]: Finished difference Result 185 states and 218 transitions. [2022-12-13 17:58:24,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-12-13 17:58:24,346 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 57 states have (on average 2.56140350877193) internal successors, (146), 54 states have internal predecessors, (146), 19 states have call successors, (50), 7 states have call predecessors, (50), 13 states have return successors, (47), 21 states have call predecessors, (47), 18 states have call successors, (47) Word has length 145 [2022-12-13 17:58:24,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:58:24,346 INFO L225 Difference]: With dead ends: 185 [2022-12-13 17:58:24,346 INFO L226 Difference]: Without dead ends: 133 [2022-12-13 17:58:24,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1479 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=524, Invalid=10606, Unknown=0, NotChecked=0, Total=11130 [2022-12-13 17:58:24,348 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 193 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 3534 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 3673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 3534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2022-12-13 17:58:24,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 1301 Invalid, 3673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 3534 Invalid, 0 Unknown, 0 Unchecked, 15.7s Time] [2022-12-13 17:58:24,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-12-13 17:58:24,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2022-12-13 17:58:24,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 85 states have (on average 1.0823529411764705) internal successors, (92), 86 states have internal predecessors, (92), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-12-13 17:58:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2022-12-13 17:58:24,363 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 145 [2022-12-13 17:58:24,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:58:24,364 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2022-12-13 17:58:24,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 57 states have (on average 2.56140350877193) internal successors, (146), 54 states have internal predecessors, (146), 19 states have call successors, (50), 7 states have call predecessors, (50), 13 states have return successors, (47), 21 states have call predecessors, (47), 18 states have call successors, (47) [2022-12-13 17:58:24,364 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2022-12-13 17:58:24,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-12-13 17:58:24,364 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:58:24,365 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 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] [2022-12-13 17:58:24,409 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 17:58:24,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 17:58:24,566 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:58:24,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:58:24,567 INFO L85 PathProgramCache]: Analyzing trace with hash 2125296268, now seen corresponding path program 10 times [2022-12-13 17:58:24,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:58:24,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061703530] [2022-12-13 17:58:24,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:58:24,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:58:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:58:27,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:58:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:58:27,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:58:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:58:27,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 17:58:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:58:27,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:58:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:58:27,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 17:58:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:58:27,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 17:58:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:58:27,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 17:58:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:58:27,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 17:58:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:58:27,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 17:58:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:58:27,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:58:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:58:27,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:58:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:58:27,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 17:58:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:58:27,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:58:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:58:27,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:58:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:58:27,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 17:58:27,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:58:27,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:58:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:58:27,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 17:58:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:58:27,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:58:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:58:27,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 17:58:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:58:28,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 17:58:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:58:28,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 17:58:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:58:29,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-12-13 17:58:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:58:29,034 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 28 proven. 48 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-12-13 17:58:29,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:58:29,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061703530] [2022-12-13 17:58:29,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061703530] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:58:29,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468380441] [2022-12-13 17:58:29,035 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 17:58:29,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:58:29,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:58:29,036 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:58:29,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 17:58:37,914 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 17:58:37,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:58:37,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 4001 conjuncts, 189 conjunts are in the unsatisfiable core [2022-12-13 17:58:37,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:58:38,716 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 17:58:38,923 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10970 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_153| Int) (v_ArrVal_10974 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (= (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_10970) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10974)) |c_#memory_int|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_153|))) (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616))) is different from true [2022-12-13 17:58:38,944 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10970 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_153| Int) (v_ArrVal_10974 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_154| Int) (v_ArrVal_10976 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_154|) (= |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_10970) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10974) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10976))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_153|))) (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616))) is different from true [2022-12-13 17:58:38,975 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10970 Int) (v_ArrVal_10980 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_153| Int) (v_ArrVal_10974 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_154| Int) (v_ArrVal_10976 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_155| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_154|) (= |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|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_10970) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10974) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10976) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_155| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10980))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_155|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_153|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_155| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|))) (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616))) is different from true [2022-12-13 17:58:39,023 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (exists ((v_ArrVal_10970 Int) (v_ArrVal_10980 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_153| Int) (v_ArrVal_10974 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_154| Int) (v_ArrVal_10976 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_155| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_156| Int) (v_ArrVal_10986 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_154|) (= (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_10970) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10974) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10976) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_155| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10980) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_156| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10986)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_156| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_155| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_156|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_155|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_153|)))) is different from true [2022-12-13 17:58:39,073 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10990 Int) (v_ArrVal_10970 Int) (v_ArrVal_10980 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_153| Int) (v_ArrVal_10974 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_154| Int) (v_ArrVal_10976 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_155| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_156| Int) (v_ArrVal_10986 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_157| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_154|) (= (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_10970) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10974) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10976) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_155| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10980) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_156| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10986) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_157| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10990)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_157| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_155| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_156|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_156| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_157|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_155|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_153|))) (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616))) is different from true [2022-12-13 17:58:39,144 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10990 Int) (v_ArrVal_10970 Int) (v_ArrVal_10980 Int) (v_ArrVal_10991 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_153| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_154| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_155| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_156| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_157| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_158| Int) (v_ArrVal_10974 Int) (v_ArrVal_10976 Int) (v_ArrVal_10986 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_154|) (= (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|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_10970) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10974) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10976) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_155| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10980) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_156| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10986) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_157| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10990) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_158| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10991)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_158| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_155| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_156|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_156| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_157|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_155|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_153|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_157| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_158|))) (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616))) is different from true [2022-12-13 17:58:39,245 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10990 Int) (v_ArrVal_10970 Int) (v_ArrVal_10980 Int) (v_ArrVal_10991 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_153| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_154| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_155| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_156| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_157| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_158| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_159| Int) (v_ArrVal_10974 Int) (v_ArrVal_10996 Int) (v_ArrVal_10976 Int) (v_ArrVal_10986 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_154|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_159| 1) |c_#Ultimate.C_memcpy_#t~loopctr1316|) (= (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|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_10970) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10974) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10976) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_155| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10980) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_156| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10986) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_157| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10990) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_158| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10991) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_159| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10996)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_155| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_156|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_156| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_157|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_155|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_153|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_157| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_158|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_158| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_159|))) (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616))) is different from true [2022-12-13 17:58:39,387 WARN L859 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (exists ((v_ArrVal_10990 Int) (v_ArrVal_11001 Int) (v_ArrVal_10970 Int) (v_ArrVal_10980 Int) (v_ArrVal_10991 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_153| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_154| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_155| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_156| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_157| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_158| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_159| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1316_160| Int) (v_ArrVal_10974 Int) (v_ArrVal_10996 Int) (v_ArrVal_10976 Int) (v_ArrVal_10986 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_159| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_160|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_154|) (= (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|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_10970) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_153| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10974) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10976) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_155| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10980) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_156| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10986) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_157| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10990) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_158| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10991) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_159| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10996) (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_160| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_11001)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_155| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_156|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_156| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_157|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_154| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_155|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1316_153|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_157| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_158|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1316_158| 1) |v_#Ultimate.C_memcpy_#t~loopctr1316_159|)))) is different from true [2022-12-13 17:58:42,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:58:42,438 INFO L321 Elim1Store]: treesize reduction 112, result has 48.4 percent of original size [2022-12-13 17:58:42,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 47 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 69 treesize of output 133 [2022-12-13 17:58:42,597 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 17:58:42,597 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 17:58:43,882 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-12-13 17:58:43,882 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 17:58:44,142 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 126 trivial. 44 not checked. [2022-12-13 17:58:44,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:59:15,344 WARN L233 SmtUtils]: Spent 28.99s on a formula simplification. DAG size of input: 222 DAG size of output: 220 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:59:27,011 WARN L233 SmtUtils]: Spent 5.64s on a formula simplification. DAG size of input: 154 DAG size of output: 136 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:59:27,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468380441] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:59:27,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:59:27,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 49] total 80 [2022-12-13 17:59:27,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137093340] [2022-12-13 17:59:27,014 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:59:27,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-12-13 17:59:27,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:59:27,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-12-13 17:59:27,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=6283, Unknown=12, NotChecked=1320, Total=7832 [2022-12-13 17:59:27,016 INFO L87 Difference]: Start difference. First operand 131 states and 153 transitions. Second operand has 80 states, 71 states have (on average 1.8732394366197183) internal successors, (133), 63 states have internal predecessors, (133), 17 states have call successors, (42), 10 states have call predecessors, (42), 15 states have return successors, (38), 21 states have call predecessors, (38), 16 states have call successors, (38) [2022-12-13 18:00:43,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:00:43,043 INFO L93 Difference]: Finished difference Result 185 states and 217 transitions. [2022-12-13 18:00:43,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-12-13 18:00:43,044 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 71 states have (on average 1.8732394366197183) internal successors, (133), 63 states have internal predecessors, (133), 17 states have call successors, (42), 10 states have call predecessors, (42), 15 states have return successors, (38), 21 states have call predecessors, (38), 16 states have call successors, (38) Word has length 145 [2022-12-13 18:00:43,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:00:43,045 INFO L225 Difference]: With dead ends: 185 [2022-12-13 18:00:43,045 INFO L226 Difference]: Without dead ends: 137 [2022-12-13 18:00:43,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 3226 ImplicationChecksByTransitivity, 28.5s TimeCoverageRelationStatistics Valid=671, Invalid=17144, Unknown=39, NotChecked=2168, Total=20022 [2022-12-13 18:00:43,049 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 176 mSDsluCounter, 1893 mSDsCounter, 0 mSdLazyCounter, 6779 mSolverCounterSat, 82 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1949 SdHoareTripleChecker+Invalid, 8104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 6779 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 1233 IncrementalHoareTripleChecker+Unchecked, 62.4s IncrementalHoareTripleChecker+Time [2022-12-13 18:00:43,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1949 Invalid, 8104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 6779 Invalid, 10 Unknown, 1233 Unchecked, 62.4s Time] [2022-12-13 18:00:43,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-12-13 18:00:43,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 131. [2022-12-13 18:00:43,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 86 states have internal predecessors, (91), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-12-13 18:00:43,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 152 transitions. [2022-12-13 18:00:43,067 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 152 transitions. Word has length 145 [2022-12-13 18:00:43,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:00:43,067 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 152 transitions. [2022-12-13 18:00:43,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 71 states have (on average 1.8732394366197183) internal successors, (133), 63 states have internal predecessors, (133), 17 states have call successors, (42), 10 states have call predecessors, (42), 15 states have return successors, (38), 21 states have call predecessors, (38), 16 states have call successors, (38) [2022-12-13 18:00:43,067 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 152 transitions. [2022-12-13 18:00:43,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-12-13 18:00:43,068 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:00:43,068 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 4, 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] [2022-12-13 18:00:43,129 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 18:00:43,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:00:43,270 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:00:43,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:00:43,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1872781388, now seen corresponding path program 11 times [2022-12-13 18:00:43,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:00:43,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142473180] [2022-12-13 18:00:43,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:00:43,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:00:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:00:44,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 18:00:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:00:44,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 18:00:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:00:44,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:00:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:00:44,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:00:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:00:44,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 18:00:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:00:44,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 18:00:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:00:44,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-12-13 18:00:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:00:44,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 18:00:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:00:44,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 18:00:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:00:44,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 18:00:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:00:44,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:00:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:00:44,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:00:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:00:44,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:00:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:00:44,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:00:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:00:44,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:00:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:00:44,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 18:00:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:00:44,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 18:00:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:00:44,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:00:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:00:44,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-12-13 18:00:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:00:44,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:00:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:00:44,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 18:00:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:00:45,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-12-13 18:00:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:00:45,604 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-12-13 18:00:45,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:00:45,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142473180] [2022-12-13 18:00:45,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142473180] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:00:45,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856224821] [2022-12-13 18:00:45,604 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 18:00:45,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:00:45,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:00:45,605 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:00:45,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fef09b2-93d9-4a4f-960e-783720c3a754/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process