./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness_negated.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_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/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_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness_negated.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/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_f8e76921-f47d-493a-9b5f-a28f1ca97091/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 3ba29ed0ea5bde1c07cf705bd33e08dacbfc25aab71db15674357fa4d073316b --- 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 16:30:08,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:30:08,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:30:08,388 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:30:08,389 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:30:08,390 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:30:08,392 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:30:08,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:30:08,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:30:08,399 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:30:08,400 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:30:08,402 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:30:08,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:30:08,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:30:08,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:30:08,407 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:30:08,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:30:08,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:30:08,412 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:30:08,415 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:30:08,418 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:30:08,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:30:08,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:30:08,422 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:30:08,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:30:08,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:30:08,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:30:08,431 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:30:08,431 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:30:08,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:30:08,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:30:08,434 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:30:08,435 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:30:08,436 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:30:08,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:30:08,437 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:30:08,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:30:08,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:30:08,438 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:30:08,438 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:30:08,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:30:08,440 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-12-13 16:30:08,462 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:30:08,462 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:30:08,462 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:30:08,462 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:30:08,463 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:30:08,468 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:30:08,469 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:30:08,469 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:30:08,469 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:30:08,470 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:30:08,470 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:30:08,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:30:08,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 16:30:08,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:30:08,471 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 16:30:08,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 16:30:08,471 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:30:08,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 16:30:08,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:30:08,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:30:08,472 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:30:08,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:30:08,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:30:08,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:30:08,472 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 16:30:08,472 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 16:30:08,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 16:30:08,472 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:30:08,473 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 16:30:08,473 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:30:08,473 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:30:08,473 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:30:08,473 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_f8e76921-f47d-493a-9b5f-a28f1ca97091/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_f8e76921-f47d-493a-9b5f-a28f1ca97091/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 -> 3ba29ed0ea5bde1c07cf705bd33e08dacbfc25aab71db15674357fa4d073316b [2022-12-13 16:30:08,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:30:08,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:30:08,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:30:08,659 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:30:08,660 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:30:08,661 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness_negated.i [2022-12-13 16:30:11,238 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:30:11,569 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:30:11,569 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness_negated.i [2022-12-13 16:30:11,590 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/data/ea21485ec/7da4147d107d47f38af7fa3a571be750/FLAG11b4d7114 [2022-12-13 16:30:11,604 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/data/ea21485ec/7da4147d107d47f38af7fa3a571be750 [2022-12-13 16:30:11,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:30:11,607 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:30:11,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:30:11,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:30:11,612 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:30:11,613 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:30:11" (1/1) ... [2022-12-13 16:30:11,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28e3528a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:30:11, skipping insertion in model container [2022-12-13 16:30:11,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:30:11" (1/1) ... [2022-12-13 16:30:11,621 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:30:11,706 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:30:11,927 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_f8e76921-f47d-493a-9b5f-a28f1ca97091/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness_negated.i[4494,4507] [2022-12-13 16:30:11,934 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_f8e76921-f47d-493a-9b5f-a28f1ca97091/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness_negated.i[4554,4567] [2022-12-13 16:30:12,570 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 16:30:12,574 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:30:12,575 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:30:12,575 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:30:12,576 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:30:12,577 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:30:12,599 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:30:12,600 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:30:12,602 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:30:12,602 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:30:12,604 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:30:12,605 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:30:12,606 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:30:12,606 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:30:12,660 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 16:30:12,661 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 16:30:12,662 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 16:30:12,666 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-12-13 16:30:12,668 WARN L623 FunctionHandler]: Unknown extern function htons [2022-12-13 16:30:12,668 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-12-13 16:30:12,885 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-12-13 16:30:12,885 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-12-13 16:30:12,886 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-12-13 16:30:12,887 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-12-13 16:30:12,887 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-12-13 16:30:12,888 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-12-13 16:30:12,889 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-12-13 16:30:12,889 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-12-13 16:30:12,889 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-12-13 16:30:12,890 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-12-13 16:30:12,890 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-12-13 16:30:12,987 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-12-13 16:30:13,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:30:13,016 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:30:13,028 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_f8e76921-f47d-493a-9b5f-a28f1ca97091/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness_negated.i[4494,4507] [2022-12-13 16:30:13,029 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_f8e76921-f47d-493a-9b5f-a28f1ca97091/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness_negated.i[4554,4567] [2022-12-13 16:30:13,056 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 16:30:13,059 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:30:13,060 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:30:13,060 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:30:13,061 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:30:13,061 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:30:13,069 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:30:13,069 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:30:13,070 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:30:13,071 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:30:13,072 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:30:13,073 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:30:13,073 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:30:13,073 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 16:30:13,080 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 16:30:13,081 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 16:30:13,081 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 16:30:13,085 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-12-13 16:30:13,086 WARN L623 FunctionHandler]: Unknown extern function htons [2022-12-13 16:30:13,086 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-12-13 16:30:13,109 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-12-13 16:30:13,109 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-12-13 16:30:13,110 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-12-13 16:30:13,111 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-12-13 16:30:13,112 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-12-13 16:30:13,113 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-12-13 16:30:13,113 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-12-13 16:30:13,114 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-12-13 16:30:13,114 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-12-13 16:30:13,114 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-12-13 16:30:13,115 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-12-13 16:30:13,136 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-12-13 16:30:13,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:30:13,399 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:30:13,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:30:13 WrapperNode [2022-12-13 16:30:13,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:30:13,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:30:13,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:30:13,401 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:30:13,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:30:13" (1/1) ... [2022-12-13 16:30:13,468 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:30:13" (1/1) ... [2022-12-13 16:30:13,507 INFO L138 Inliner]: procedures = 679, calls = 1044, calls flagged for inlining = 50, calls inlined = 5, statements flattened = 133 [2022-12-13 16:30:13,508 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:30:13,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:30:13,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:30:13,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:30:13,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:30:13" (1/1) ... [2022-12-13 16:30:13,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:30:13" (1/1) ... [2022-12-13 16:30:13,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:30:13" (1/1) ... [2022-12-13 16:30:13,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:30:13" (1/1) ... [2022-12-13 16:30:13,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:30:13" (1/1) ... [2022-12-13 16:30:13,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:30:13" (1/1) ... [2022-12-13 16:30:13,546 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:30:13" (1/1) ... [2022-12-13 16:30:13,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:30:13" (1/1) ... [2022-12-13 16:30:13,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:30:13,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:30:13,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:30:13,557 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:30:13,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:30:13" (1/1) ... [2022-12-13 16:30:13,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:30:13,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:30:13,584 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:30:13,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:30:13,609 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_back [2022-12-13 16:30:13,609 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_back [2022-12-13 16:30:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 16:30:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-13 16:30:13,610 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-13 16:30:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-12-13 16:30:13,610 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-12-13 16:30:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 16:30:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-12-13 16:30:13,610 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-12-13 16:30:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:30:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 16:30:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:30:13,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:30:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2022-12-13 16:30:13,610 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2022-12-13 16:30:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 16:30:13,610 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 16:30:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 16:30:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 16:30:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 16:30:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-12-13 16:30:13,611 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-12-13 16:30:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-12-13 16:30:13,611 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-12-13 16:30:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 16:30:13,791 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:30:13,793 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:30:14,022 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:30:14,029 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:30:14,029 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 16:30:14,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:30:14 BoogieIcfgContainer [2022-12-13 16:30:14,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:30:14,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:30:14,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:30:14,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:30:14,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:30:11" (1/3) ... [2022-12-13 16:30:14,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287165b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:30:14, skipping insertion in model container [2022-12-13 16:30:14,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:30:13" (2/3) ... [2022-12-13 16:30:14,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287165b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:30:14, skipping insertion in model container [2022-12-13 16:30:14,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:30:14" (3/3) ... [2022-12-13 16:30:14,039 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_back_harness_negated.i [2022-12-13 16:30:14,055 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:30:14,055 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 16:30:14,102 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:30:14,108 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;@4707782d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:30:14,108 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 16:30:14,112 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 64 states have (on average 1.296875) internal successors, (83), 65 states have internal predecessors, (83), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-12-13 16:30:14,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-13 16:30:14,119 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:30:14,120 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:30:14,120 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:30:14,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:30:14,124 INFO L85 PathProgramCache]: Analyzing trace with hash 464723229, now seen corresponding path program 1 times [2022-12-13 16:30:14,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:30:14,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645987188] [2022-12-13 16:30:14,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:14,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:30:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:14,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:30:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:14,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:30:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:14,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 16:30:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:14,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:14,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:30:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:14,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:30:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:14,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 16:30:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:14,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-12-13 16:30:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:14,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:14,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 16:30:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:14,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 16:30:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:14,583 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-12-13 16:30:14,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:30:14,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645987188] [2022-12-13 16:30:14,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645987188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:30:14,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:30:14,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:30:14,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735808828] [2022-12-13 16:30:14,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:30:14,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 16:30:14,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:30:14,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 16:30:14,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 16:30:14,622 INFO L87 Difference]: Start difference. First operand has 98 states, 64 states have (on average 1.296875) internal successors, (83), 65 states have internal predecessors, (83), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:30:14,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:30:14,650 INFO L93 Difference]: Finished difference Result 188 states and 271 transitions. [2022-12-13 16:30:14,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 16:30:14,652 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 84 [2022-12-13 16:30:14,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:30:14,657 INFO L225 Difference]: With dead ends: 188 [2022-12-13 16:30:14,657 INFO L226 Difference]: Without dead ends: 93 [2022-12-13 16:30:14,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 16:30:14,663 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:30:14,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:30:14,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-12-13 16:30:14,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-12-13 16:30:14,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-12-13 16:30:14,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2022-12-13 16:30:14,696 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 84 [2022-12-13 16:30:14,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:30:14,696 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2022-12-13 16:30:14,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:30:14,696 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2022-12-13 16:30:14,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-13 16:30:14,698 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:30:14,698 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:30:14,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 16:30:14,699 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:30:14,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:30:14,699 INFO L85 PathProgramCache]: Analyzing trace with hash 463621205, now seen corresponding path program 1 times [2022-12-13 16:30:14,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:30:14,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541285125] [2022-12-13 16:30:14,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:14,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:30:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:14,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:30:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:14,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:30:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:14,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 16:30:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:14,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:14,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:30:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:14,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:30:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:15,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 16:30:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:15,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-12-13 16:30:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:15,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:15,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 16:30:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:15,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 16:30:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:15,152 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-12-13 16:30:15,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:30:15,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541285125] [2022-12-13 16:30:15,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541285125] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:30:15,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314118259] [2022-12-13 16:30:15,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:15,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:30:15,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:30:15,155 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:30:15,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 16:30:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:15,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 16:30:15,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:30:15,345 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-13 16:30:15,345 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:30:15,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314118259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:30:15,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:30:15,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2022-12-13 16:30:15,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712216628] [2022-12-13 16:30:15,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:30:15,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:30:15,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:30:15,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:30:15,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:30:15,347 INFO L87 Difference]: Start difference. First operand 93 states and 122 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 16:30:15,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:30:15,418 INFO L93 Difference]: Finished difference Result 169 states and 224 transitions. [2022-12-13 16:30:15,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:30:15,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 84 [2022-12-13 16:30:15,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:30:15,421 INFO L225 Difference]: With dead ends: 169 [2022-12-13 16:30:15,422 INFO L226 Difference]: Without dead ends: 95 [2022-12-13 16:30:15,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:30:15,423 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 2 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:30:15,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 558 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:30:15,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-12-13 16:30:15,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-12-13 16:30:15,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 63 states have internal predecessors, (76), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2022-12-13 16:30:15,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 125 transitions. [2022-12-13 16:30:15,437 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 125 transitions. Word has length 84 [2022-12-13 16:30:15,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:30:15,437 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 125 transitions. [2022-12-13 16:30:15,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 16:30:15,438 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 125 transitions. [2022-12-13 16:30:15,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-13 16:30:15,439 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:30:15,440 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:30:15,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 16:30:15,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:30:15,641 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:30:15,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:30:15,641 INFO L85 PathProgramCache]: Analyzing trace with hash -583798319, now seen corresponding path program 1 times [2022-12-13 16:30:15,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:30:15,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220786711] [2022-12-13 16:30:15,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:15,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:30:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:15,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:30:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:15,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:30:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:15,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 16:30:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:15,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:15,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:30:15,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:15,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:30:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:16,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 16:30:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:16,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:30:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:16,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:16,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 16:30:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:16,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 16:30:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:16,113 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-12-13 16:30:16,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:30:16,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220786711] [2022-12-13 16:30:16,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220786711] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:30:16,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418468489] [2022-12-13 16:30:16,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:16,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:30:16,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:30:16,115 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:30:16,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 16:30:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:16,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 16:30:16,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:30:16,352 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 16:30:16,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:30:16,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418468489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:30:16,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:30:16,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2022-12-13 16:30:16,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870548512] [2022-12-13 16:30:16,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:30:16,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 16:30:16,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:30:16,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 16:30:16,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 16:30:16,356 INFO L87 Difference]: Start difference. First operand 95 states and 125 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-12-13 16:30:16,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:30:16,615 INFO L93 Difference]: Finished difference Result 174 states and 231 transitions. [2022-12-13 16:30:16,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:30:16,616 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 86 [2022-12-13 16:30:16,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:30:16,618 INFO L225 Difference]: With dead ends: 174 [2022-12-13 16:30:16,618 INFO L226 Difference]: Without dead ends: 95 [2022-12-13 16:30:16,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-12-13 16:30:16,621 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 145 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:30:16,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 527 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:30:16,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-12-13 16:30:16,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-12-13 16:30:16,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 63 states have internal predecessors, (75), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2022-12-13 16:30:16,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 124 transitions. [2022-12-13 16:30:16,635 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 124 transitions. Word has length 86 [2022-12-13 16:30:16,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:30:16,636 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 124 transitions. [2022-12-13 16:30:16,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-12-13 16:30:16,636 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 124 transitions. [2022-12-13 16:30:16,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-12-13 16:30:16,638 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:30:16,638 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:30:16,644 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 16:30:16,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-12-13 16:30:16,840 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:30:16,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:30:16,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1801781246, now seen corresponding path program 1 times [2022-12-13 16:30:16,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:30:16,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842721227] [2022-12-13 16:30:16,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:16,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:30:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:17,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:30:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:17,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:30:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:17,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 16:30:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:17,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:17,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:30:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:17,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:30:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:17,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 16:30:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:17,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 16:30:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:17,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:17,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 16:30:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:17,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 16:30:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:17,150 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-12-13 16:30:17,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:30:17,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842721227] [2022-12-13 16:30:17,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842721227] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:30:17,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336907664] [2022-12-13 16:30:17,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:17,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:30:17,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:30:17,152 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:30:17,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 16:30:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:17,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 16:30:17,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:30:17,391 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 16:30:17,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:30:17,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336907664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:30:17,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:30:17,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2022-12-13 16:30:17,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865367228] [2022-12-13 16:30:17,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:30:17,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 16:30:17,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:30:17,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 16:30:17,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-12-13 16:30:17,394 INFO L87 Difference]: Start difference. First operand 95 states and 124 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-12-13 16:30:17,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:30:17,669 INFO L93 Difference]: Finished difference Result 183 states and 244 transitions. [2022-12-13 16:30:17,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 16:30:17,670 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 88 [2022-12-13 16:30:17,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:30:17,671 INFO L225 Difference]: With dead ends: 183 [2022-12-13 16:30:17,672 INFO L226 Difference]: Without dead ends: 103 [2022-12-13 16:30:17,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-12-13 16:30:17,673 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 182 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:30:17,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 583 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:30:17,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-12-13 16:30:17,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2022-12-13 16:30:17,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 64 states have internal predecessors, (76), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2022-12-13 16:30:17,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 125 transitions. [2022-12-13 16:30:17,685 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 125 transitions. Word has length 88 [2022-12-13 16:30:17,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:30:17,685 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 125 transitions. [2022-12-13 16:30:17,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-12-13 16:30:17,686 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 125 transitions. [2022-12-13 16:30:17,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-13 16:30:17,687 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:30:17,687 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:30:17,692 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 16:30:17,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:30:17,888 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:30:17,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:30:17,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1442434984, now seen corresponding path program 1 times [2022-12-13 16:30:17,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:30:17,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000806016] [2022-12-13 16:30:17,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:17,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:30:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:18,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:30:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:18,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:30:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:18,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 16:30:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:18,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:18,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:30:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:18,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:30:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:18,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 16:30:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:18,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-12-13 16:30:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:18,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:18,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 16:30:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:18,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 16:30:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:18,170 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-12-13 16:30:18,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:30:18,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000806016] [2022-12-13 16:30:18,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000806016] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:30:18,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122411154] [2022-12-13 16:30:18,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:18,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:30:18,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:30:18,172 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:30:18,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 16:30:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:18,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 16:30:18,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:30:18,317 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 16:30:18,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:30:18,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122411154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:30:18,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:30:18,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-12-13 16:30:18,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010038973] [2022-12-13 16:30:18,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:30:18,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:30:18,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:30:18,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:30:18,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:30:18,320 INFO L87 Difference]: Start difference. First operand 96 states and 125 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-12-13 16:30:18,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:30:18,338 INFO L93 Difference]: Finished difference Result 179 states and 240 transitions. [2022-12-13 16:30:18,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:30:18,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2022-12-13 16:30:18,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:30:18,340 INFO L225 Difference]: With dead ends: 179 [2022-12-13 16:30:18,340 INFO L226 Difference]: Without dead ends: 102 [2022-12-13 16:30:18,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:30:18,342 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 4 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:30:18,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 237 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:30:18,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-12-13 16:30:18,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2022-12-13 16:30:18,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 65 states have internal predecessors, (77), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2022-12-13 16:30:18,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2022-12-13 16:30:18,355 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 126 transitions. Word has length 89 [2022-12-13 16:30:18,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:30:18,355 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 126 transitions. [2022-12-13 16:30:18,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-12-13 16:30:18,355 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2022-12-13 16:30:18,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-13 16:30:18,357 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:30:18,357 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:30:18,362 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 16:30:18,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:30:18,559 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:30:18,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:30:18,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1734248118, now seen corresponding path program 1 times [2022-12-13 16:30:18,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:30:18,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649990758] [2022-12-13 16:30:18,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:18,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:30:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:18,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:30:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:18,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:30:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:18,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 16:30:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:18,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:18,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:30:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:18,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:30:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:18,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:30:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:18,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 16:30:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:18,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 16:30:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:18,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:18,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 16:30:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:18,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 16:30:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:18,908 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-12-13 16:30:18,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:30:18,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649990758] [2022-12-13 16:30:18,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649990758] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:30:18,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131786494] [2022-12-13 16:30:18,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:18,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:30:18,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:30:18,909 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:30:18,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 16:30:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:19,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 16:30:19,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:30:19,065 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-13 16:30:19,065 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:30:19,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131786494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:30:19,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:30:19,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2022-12-13 16:30:19,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090085834] [2022-12-13 16:30:19,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:30:19,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:30:19,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:30:19,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:30:19,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:30:19,067 INFO L87 Difference]: Start difference. First operand 97 states and 126 transitions. Second operand has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-12-13 16:30:19,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:30:19,130 INFO L93 Difference]: Finished difference Result 178 states and 233 transitions. [2022-12-13 16:30:19,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 16:30:19,130 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2022-12-13 16:30:19,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:30:19,131 INFO L225 Difference]: With dead ends: 178 [2022-12-13 16:30:19,131 INFO L226 Difference]: Without dead ends: 100 [2022-12-13 16:30:19,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:30:19,133 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 4 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:30:19,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 673 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:30:19,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-12-13 16:30:19,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2022-12-13 16:30:19,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.21875) internal successors, (78), 66 states have internal predecessors, (78), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2022-12-13 16:30:19,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 127 transitions. [2022-12-13 16:30:19,147 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 127 transitions. Word has length 97 [2022-12-13 16:30:19,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:30:19,147 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 127 transitions. [2022-12-13 16:30:19,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-12-13 16:30:19,148 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2022-12-13 16:30:19,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-13 16:30:19,149 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:30:19,149 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:30:19,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 16:30:19,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:30:19,350 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:30:19,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:30:19,350 INFO L85 PathProgramCache]: Analyzing trace with hash 26119479, now seen corresponding path program 1 times [2022-12-13 16:30:19,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:30:19,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233211411] [2022-12-13 16:30:19,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:19,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:30:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:19,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:30:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:19,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:30:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:19,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 16:30:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:19,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:19,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:30:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:19,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:30:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:19,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:30:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:19,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-12-13 16:30:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:19,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 16:30:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:19,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:19,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 16:30:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:19,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 16:30:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:19,811 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-12-13 16:30:19,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:30:19,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233211411] [2022-12-13 16:30:19,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233211411] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:30:19,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153335111] [2022-12-13 16:30:19,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:19,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:30:19,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:30:19,812 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:30:19,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 16:30:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:19,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 16:30:19,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:30:20,036 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 16:30:20,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:30:20,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153335111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:30:20,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:30:20,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2022-12-13 16:30:20,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943732567] [2022-12-13 16:30:20,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:30:20,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:30:20,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:30:20,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:30:20,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-12-13 16:30:20,037 INFO L87 Difference]: Start difference. First operand 98 states and 127 transitions. Second operand has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 4 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-12-13 16:30:20,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:30:20,124 INFO L93 Difference]: Finished difference Result 183 states and 239 transitions. [2022-12-13 16:30:20,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:30:20,125 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 4 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 99 [2022-12-13 16:30:20,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:30:20,126 INFO L225 Difference]: With dead ends: 183 [2022-12-13 16:30:20,126 INFO L226 Difference]: Without dead ends: 104 [2022-12-13 16:30:20,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-12-13 16:30:20,127 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 8 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:30:20,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 774 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:30:20,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-12-13 16:30:20,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2022-12-13 16:30:20,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 67 states have internal predecessors, (79), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2022-12-13 16:30:20,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 128 transitions. [2022-12-13 16:30:20,133 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 128 transitions. Word has length 99 [2022-12-13 16:30:20,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:30:20,133 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 128 transitions. [2022-12-13 16:30:20,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 4 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-12-13 16:30:20,133 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 128 transitions. [2022-12-13 16:30:20,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-12-13 16:30:20,134 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:30:20,134 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:30:20,140 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 16:30:20,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-13 16:30:20,335 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:30:20,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:30:20,335 INFO L85 PathProgramCache]: Analyzing trace with hash -2063472241, now seen corresponding path program 1 times [2022-12-13 16:30:20,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:30:20,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153242540] [2022-12-13 16:30:20,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:20,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:30:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:20,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:30:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:20,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:30:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:20,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 16:30:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:20,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:20,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:30:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:20,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:30:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:20,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:30:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:20,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 16:30:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:20,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 16:30:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:20,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:20,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 16:30:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:20,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 16:30:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-12-13 16:30:20,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:30:20,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153242540] [2022-12-13 16:30:20,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153242540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:30:20,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:30:20,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 16:30:20,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962359796] [2022-12-13 16:30:20,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:30:20,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:30:20,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:30:20,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:30:20,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:30:20,604 INFO L87 Difference]: Start difference. First operand 99 states and 128 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-12-13 16:30:20,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:30:20,641 INFO L93 Difference]: Finished difference Result 109 states and 139 transitions. [2022-12-13 16:30:20,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:30:20,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2022-12-13 16:30:20,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:30:20,643 INFO L225 Difference]: With dead ends: 109 [2022-12-13 16:30:20,643 INFO L226 Difference]: Without dead ends: 107 [2022-12-13 16:30:20,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:30:20,644 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 5 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:30:20,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 580 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:30:20,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-12-13 16:30:20,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2022-12-13 16:30:20,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 72 states have internal predecessors, (83), 25 states have call successors, (25), 9 states have call predecessors, (25), 11 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2022-12-13 16:30:20,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 136 transitions. [2022-12-13 16:30:20,655 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 136 transitions. Word has length 100 [2022-12-13 16:30:20,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:30:20,655 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 136 transitions. [2022-12-13 16:30:20,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-12-13 16:30:20,656 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 136 transitions. [2022-12-13 16:30:20,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-13 16:30:20,657 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:30:20,657 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:30:20,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 16:30:20,657 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:30:20,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:30:20,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1093753190, now seen corresponding path program 1 times [2022-12-13 16:30:20,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:30:20,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938576241] [2022-12-13 16:30:20,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:20,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:30:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:20,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:30:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:20,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:30:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:20,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 16:30:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:20,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:20,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:30:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:20,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:30:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:20,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:30:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:20,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 16:30:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:20,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 16:30:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:20,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:20,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 16:30:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:20,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 16:30:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:20,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:30:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:20,995 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-12-13 16:30:20,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:30:20,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938576241] [2022-12-13 16:30:20,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938576241] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:30:20,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:30:20,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:30:20,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33242359] [2022-12-13 16:30:20,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:30:20,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:30:20,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:30:20,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:30:20,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:30:20,997 INFO L87 Difference]: Start difference. First operand 106 states and 136 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-12-13 16:30:21,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:30:21,047 INFO L93 Difference]: Finished difference Result 117 states and 148 transitions. [2022-12-13 16:30:21,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 16:30:21,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 113 [2022-12-13 16:30:21,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:30:21,049 INFO L225 Difference]: With dead ends: 117 [2022-12-13 16:30:21,049 INFO L226 Difference]: Without dead ends: 115 [2022-12-13 16:30:21,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:30:21,050 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 7 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:30:21,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 703 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:30:21,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-12-13 16:30:21,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2022-12-13 16:30:21,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.2) internal successors, (84), 73 states have internal predecessors, (84), 25 states have call successors, (25), 9 states have call predecessors, (25), 11 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2022-12-13 16:30:21,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 137 transitions. [2022-12-13 16:30:21,057 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 137 transitions. Word has length 113 [2022-12-13 16:30:21,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:30:21,057 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 137 transitions. [2022-12-13 16:30:21,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-12-13 16:30:21,057 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 137 transitions. [2022-12-13 16:30:21,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-12-13 16:30:21,058 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:30:21,058 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:30:21,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 16:30:21,058 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:30:21,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:30:21,059 INFO L85 PathProgramCache]: Analyzing trace with hash 226546439, now seen corresponding path program 1 times [2022-12-13 16:30:21,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:30:21,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669981172] [2022-12-13 16:30:21,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:21,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:30:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:21,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:30:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:21,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:30:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:21,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 16:30:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:21,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:21,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:30:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:21,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:30:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:21,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:30:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:21,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 16:30:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:21,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 16:30:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:21,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:21,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 16:30:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:21,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 16:30:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:21,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:30:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:21,661 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-12-13 16:30:21,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:30:21,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669981172] [2022-12-13 16:30:21,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669981172] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:30:21,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607942259] [2022-12-13 16:30:21,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:21,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:30:21,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:30:21,662 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:30:21,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 16:30:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:21,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 95 conjunts are in the unsatisfiable core [2022-12-13 16:30:21,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:30:21,900 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:30:21,900 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 16:30:23,001 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 58 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 16:30:23,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:30:24,365 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 121 treesize of output 113 [2022-12-13 16:30:24,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 105 [2022-12-13 16:30:24,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 101 [2022-12-13 16:30:24,440 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-12-13 16:30:24,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607942259] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:30:24,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 16:30:24,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 26, 25] total 59 [2022-12-13 16:30:24,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157998959] [2022-12-13 16:30:24,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 16:30:24,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-12-13 16:30:24,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:30:24,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-12-13 16:30:24,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=3204, Unknown=0, NotChecked=0, Total=3422 [2022-12-13 16:30:24,445 INFO L87 Difference]: Start difference. First operand 107 states and 137 transitions. Second operand has 59 states, 55 states have (on average 2.890909090909091) internal successors, (159), 52 states have internal predecessors, (159), 19 states have call successors, (33), 6 states have call predecessors, (33), 11 states have return successors, (31), 17 states have call predecessors, (31), 18 states have call successors, (31) [2022-12-13 16:30:36,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:30:36,704 INFO L93 Difference]: Finished difference Result 473 states and 632 transitions. [2022-12-13 16:30:36,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2022-12-13 16:30:36,704 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 55 states have (on average 2.890909090909091) internal successors, (159), 52 states have internal predecessors, (159), 19 states have call successors, (33), 6 states have call predecessors, (33), 11 states have return successors, (31), 17 states have call predecessors, (31), 18 states have call successors, (31) Word has length 115 [2022-12-13 16:30:36,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:30:36,707 INFO L225 Difference]: With dead ends: 473 [2022-12-13 16:30:36,707 INFO L226 Difference]: Without dead ends: 401 [2022-12-13 16:30:36,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 213 SyntacticMatches, 3 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11294 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=4912, Invalid=31760, Unknown=0, NotChecked=0, Total=36672 [2022-12-13 16:30:36,716 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 998 mSDsluCounter, 2922 mSDsCounter, 0 mSdLazyCounter, 4442 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 3051 SdHoareTripleChecker+Invalid, 4845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 4442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-12-13 16:30:36,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 3051 Invalid, 4845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 4442 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-12-13 16:30:36,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2022-12-13 16:30:36,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 251. [2022-12-13 16:30:36,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 177 states have (on average 1.2881355932203389) internal successors, (228), 183 states have internal predecessors, (228), 50 states have call successors, (50), 17 states have call predecessors, (50), 23 states have return successors, (59), 50 states have call predecessors, (59), 48 states have call successors, (59) [2022-12-13 16:30:36,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 337 transitions. [2022-12-13 16:30:36,762 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 337 transitions. Word has length 115 [2022-12-13 16:30:36,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:30:36,763 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 337 transitions. [2022-12-13 16:30:36,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 55 states have (on average 2.890909090909091) internal successors, (159), 52 states have internal predecessors, (159), 19 states have call successors, (33), 6 states have call predecessors, (33), 11 states have return successors, (31), 17 states have call predecessors, (31), 18 states have call successors, (31) [2022-12-13 16:30:36,763 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 337 transitions. [2022-12-13 16:30:36,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-13 16:30:36,765 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:30:36,765 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:30:36,771 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 16:30:36,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 16:30:36,966 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:30:36,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:30:36,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1166595426, now seen corresponding path program 1 times [2022-12-13 16:30:36,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:30:36,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432638427] [2022-12-13 16:30:36,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:36,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:30:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:37,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:30:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:37,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:30:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:37,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 16:30:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:37,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:37,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:30:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:37,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:30:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:38,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:30:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:38,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 16:30:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:38,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 16:30:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:38,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:38,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 16:30:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:38,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 16:30:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:38,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 16:30:38,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:38,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-12-13 16:30:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:38,101 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-13 16:30:38,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:30:38,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432638427] [2022-12-13 16:30:38,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432638427] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:30:38,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467783660] [2022-12-13 16:30:38,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:38,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:30:38,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:30:38,103 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:30:38,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 16:30:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:38,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-13 16:30:38,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:30:38,312 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:30:38,312 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 16:30:38,323 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:30:38,323 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 16:30:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-13 16:30:39,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:30:39,737 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-13 16:30:39,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467783660] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:30:39,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 16:30:39,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 9] total 34 [2022-12-13 16:30:39,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117382038] [2022-12-13 16:30:39,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 16:30:39,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 16:30:39,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:30:39,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 16:30:39,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1018, Unknown=0, NotChecked=0, Total=1122 [2022-12-13 16:30:39,739 INFO L87 Difference]: Start difference. First operand 251 states and 337 transitions. Second operand has 34 states, 31 states have (on average 5.064516129032258) internal successors, (157), 31 states have internal predecessors, (157), 14 states have call successors, (40), 6 states have call predecessors, (40), 10 states have return successors, (37), 12 states have call predecessors, (37), 13 states have call successors, (37) [2022-12-13 16:30:42,267 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 16:30:44,285 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 16:30:46,303 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 16:30:48,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:30:48,170 INFO L93 Difference]: Finished difference Result 464 states and 609 transitions. [2022-12-13 16:30:48,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-13 16:30:48,171 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 5.064516129032258) internal successors, (157), 31 states have internal predecessors, (157), 14 states have call successors, (40), 6 states have call predecessors, (40), 10 states have return successors, (37), 12 states have call predecessors, (37), 13 states have call successors, (37) Word has length 114 [2022-12-13 16:30:48,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:30:48,172 INFO L225 Difference]: With dead ends: 464 [2022-12-13 16:30:48,172 INFO L226 Difference]: Without dead ends: 219 [2022-12-13 16:30:48,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 237 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=435, Invalid=3725, Unknown=0, NotChecked=0, Total=4160 [2022-12-13 16:30:48,174 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 246 mSDsluCounter, 1880 mSDsCounter, 0 mSdLazyCounter, 2186 mSolverCounterSat, 139 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1994 SdHoareTripleChecker+Invalid, 2328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 2186 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:30:48,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1994 Invalid, 2328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 2186 Invalid, 3 Unknown, 0 Unchecked, 7.5s Time] [2022-12-13 16:30:48,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-12-13 16:30:48,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 182. [2022-12-13 16:30:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 134 states have (on average 1.2611940298507462) internal successors, (169), 137 states have internal predecessors, (169), 30 states have call successors, (30), 15 states have call predecessors, (30), 17 states have return successors, (33), 29 states have call predecessors, (33), 29 states have call successors, (33) [2022-12-13 16:30:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 232 transitions. [2022-12-13 16:30:48,189 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 232 transitions. Word has length 114 [2022-12-13 16:30:48,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:30:48,189 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 232 transitions. [2022-12-13 16:30:48,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 5.064516129032258) internal successors, (157), 31 states have internal predecessors, (157), 14 states have call successors, (40), 6 states have call predecessors, (40), 10 states have return successors, (37), 12 states have call predecessors, (37), 13 states have call successors, (37) [2022-12-13 16:30:48,189 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 232 transitions. [2022-12-13 16:30:48,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-12-13 16:30:48,190 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:30:48,190 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:30:48,196 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 16:30:48,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 16:30:48,392 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:30:48,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:30:48,393 INFO L85 PathProgramCache]: Analyzing trace with hash -172841003, now seen corresponding path program 1 times [2022-12-13 16:30:48,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:30:48,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673553925] [2022-12-13 16:30:48,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:48,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:30:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:49,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:30:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:49,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:30:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:49,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 16:30:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:49,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:49,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:30:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:49,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:30:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:49,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:30:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:49,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 16:30:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:49,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 16:30:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:49,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-12-13 16:30:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:49,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:49,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-12-13 16:30:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:49,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-12-13 16:30:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:49,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 16:30:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:49,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 16:30:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:49,548 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-12-13 16:30:49,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:30:49,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673553925] [2022-12-13 16:30:49,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673553925] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:30:49,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379751089] [2022-12-13 16:30:49,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:49,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:30:49,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:30:49,550 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:30:49,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 16:30:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:49,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-13 16:30:49,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:30:49,757 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:30:49,758 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 16:30:49,768 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:30:49,768 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 16:30:49,935 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 19 treesize of output 7 [2022-12-13 16:30:49,937 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 19 treesize of output 7 [2022-12-13 16:30:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-12-13 16:30:50,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:30:50,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379751089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:30:50,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:30:50,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 22 [2022-12-13 16:30:50,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520532608] [2022-12-13 16:30:50,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:30:50,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 16:30:50,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:30:50,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 16:30:50,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2022-12-13 16:30:50,021 INFO L87 Difference]: Start difference. First operand 182 states and 232 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-12-13 16:30:50,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:30:50,393 INFO L93 Difference]: Finished difference Result 362 states and 479 transitions. [2022-12-13 16:30:50,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 16:30:50,394 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 125 [2022-12-13 16:30:50,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:30:50,396 INFO L225 Difference]: With dead ends: 362 [2022-12-13 16:30:50,396 INFO L226 Difference]: Without dead ends: 220 [2022-12-13 16:30:50,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2022-12-13 16:30:50,397 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 51 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:30:50,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 917 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:30:50,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-12-13 16:30:50,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 204. [2022-12-13 16:30:50,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 152 states have (on average 1.263157894736842) internal successors, (192), 157 states have internal predecessors, (192), 32 states have call successors, (32), 15 states have call predecessors, (32), 19 states have return successors, (38), 31 states have call predecessors, (38), 31 states have call successors, (38) [2022-12-13 16:30:50,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 262 transitions. [2022-12-13 16:30:50,420 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 262 transitions. Word has length 125 [2022-12-13 16:30:50,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:30:50,420 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 262 transitions. [2022-12-13 16:30:50,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-12-13 16:30:50,420 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 262 transitions. [2022-12-13 16:30:50,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-12-13 16:30:50,422 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:30:50,422 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:30:50,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 16:30:50,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 16:30:50,623 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:30:50,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:30:50,624 INFO L85 PathProgramCache]: Analyzing trace with hash -565868013, now seen corresponding path program 1 times [2022-12-13 16:30:50,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:30:50,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997545971] [2022-12-13 16:30:50,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:50,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:30:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:50,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:30:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:50,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:30:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:50,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 16:30:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:50,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:50,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:30:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:50,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:30:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:50,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:30:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:50,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 16:30:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:50,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 16:30:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:50,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-12-13 16:30:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:50,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:50,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-12-13 16:30:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:50,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-12-13 16:30:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:50,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 16:30:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:50,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 16:30:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:50,781 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-12-13 16:30:50,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:30:50,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997545971] [2022-12-13 16:30:50,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997545971] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:30:50,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:30:50,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:30:50,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514244795] [2022-12-13 16:30:50,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:30:50,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:30:50,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:30:50,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:30:50,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:30:50,783 INFO L87 Difference]: Start difference. First operand 204 states and 262 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-12-13 16:30:50,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:30:50,816 INFO L93 Difference]: Finished difference Result 293 states and 383 transitions. [2022-12-13 16:30:50,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:30:50,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 125 [2022-12-13 16:30:50,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:30:50,817 INFO L225 Difference]: With dead ends: 293 [2022-12-13 16:30:50,817 INFO L226 Difference]: Without dead ends: 205 [2022-12-13 16:30:50,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:30:50,819 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 2 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:30:50,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 354 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:30:50,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-12-13 16:30:50,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2022-12-13 16:30:50,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 152 states have (on average 1.256578947368421) internal successors, (191), 157 states have internal predecessors, (191), 32 states have call successors, (32), 15 states have call predecessors, (32), 19 states have return successors, (38), 31 states have call predecessors, (38), 31 states have call successors, (38) [2022-12-13 16:30:50,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 261 transitions. [2022-12-13 16:30:50,838 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 261 transitions. Word has length 125 [2022-12-13 16:30:50,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:30:50,839 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 261 transitions. [2022-12-13 16:30:50,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-12-13 16:30:50,839 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 261 transitions. [2022-12-13 16:30:50,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-12-13 16:30:50,840 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:30:50,840 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:30:50,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 16:30:50,840 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:30:50,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:30:50,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1375214639, now seen corresponding path program 1 times [2022-12-13 16:30:50,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:30:50,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615707921] [2022-12-13 16:30:50,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:50,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:30:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:51,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:30:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:51,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:30:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:51,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 16:30:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:51,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:51,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:30:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:51,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:30:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:52,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:30:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:52,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 16:30:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:52,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 16:30:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:52,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-12-13 16:30:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:52,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:52,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-12-13 16:30:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:52,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-12-13 16:30:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:52,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 16:30:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:52,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 16:30:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:52,266 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-12-13 16:30:52,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:30:52,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615707921] [2022-12-13 16:30:52,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615707921] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:30:52,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684327595] [2022-12-13 16:30:52,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:52,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:30:52,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:30:52,268 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:30:52,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 16:30:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:52,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 16:30:52,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:30:52,586 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-12-13 16:30:52,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:30:52,759 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-12-13 16:30:52,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684327595] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 16:30:52,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:30:52,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14, 14] total 30 [2022-12-13 16:30:52,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564045471] [2022-12-13 16:30:52,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:30:52,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:30:52,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:30:52,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:30:52,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=809, Unknown=0, NotChecked=0, Total=870 [2022-12-13 16:30:52,760 INFO L87 Difference]: Start difference. First operand 204 states and 261 transitions. Second operand has 7 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-12-13 16:30:52,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:30:52,822 INFO L93 Difference]: Finished difference Result 215 states and 273 transitions. [2022-12-13 16:30:52,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 16:30:52,823 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 125 [2022-12-13 16:30:52,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:30:52,824 INFO L225 Difference]: With dead ends: 215 [2022-12-13 16:30:52,824 INFO L226 Difference]: Without dead ends: 213 [2022-12-13 16:30:52,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=865, Unknown=0, NotChecked=0, Total=930 [2022-12-13 16:30:52,825 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 4 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:30:52,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 731 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:30:52,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-12-13 16:30:52,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2022-12-13 16:30:52,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 157 states have (on average 1.2484076433121019) internal successors, (196), 163 states have internal predecessors, (196), 33 states have call successors, (33), 16 states have call predecessors, (33), 21 states have return successors, (41), 32 states have call predecessors, (41), 32 states have call successors, (41) [2022-12-13 16:30:52,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 270 transitions. [2022-12-13 16:30:52,840 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 270 transitions. Word has length 125 [2022-12-13 16:30:52,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:30:52,840 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 270 transitions. [2022-12-13 16:30:52,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-12-13 16:30:52,840 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 270 transitions. [2022-12-13 16:30:52,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-12-13 16:30:52,841 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:30:52,841 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:30:52,847 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 16:30:53,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:30:53,042 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:30:53,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:30:53,043 INFO L85 PathProgramCache]: Analyzing trace with hash -306854509, now seen corresponding path program 1 times [2022-12-13 16:30:53,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:30:53,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053425248] [2022-12-13 16:30:53,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:53,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:30:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:53,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:30:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:53,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:30:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:53,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 16:30:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:53,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:53,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:30:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:53,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:30:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:53,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:30:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:53,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 16:30:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:53,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 16:30:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:53,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-12-13 16:30:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:54,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:30:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:54,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-12-13 16:30:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:54,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-12-13 16:30:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:54,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 16:30:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:54,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 16:30:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:54,018 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-12-13 16:30:54,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:30:54,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053425248] [2022-12-13 16:30:54,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053425248] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:30:54,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648192649] [2022-12-13 16:30:54,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:30:54,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:30:54,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:30:54,019 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:30:54,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 16:30:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:30:54,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 16:30:54,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:30:54,207 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:30:54,208 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 16:30:54,219 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:30:54,219 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 16:30:55,502 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-12-13 16:30:55,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:30:56,052 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-12-13 16:30:56,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648192649] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:30:56,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 16:30:56,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 11] total 37 [2022-12-13 16:30:56,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081082074] [2022-12-13 16:30:56,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 16:30:56,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-13 16:30:56,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:30:56,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-13 16:30:56,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1215, Unknown=0, NotChecked=0, Total=1332 [2022-12-13 16:30:56,055 INFO L87 Difference]: Start difference. First operand 212 states and 270 transitions. Second operand has 37 states, 35 states have (on average 4.3428571428571425) internal successors, (152), 35 states have internal predecessors, (152), 14 states have call successors, (41), 6 states have call predecessors, (41), 8 states have return successors, (37), 12 states have call predecessors, (37), 14 states have call successors, (37) [2022-12-13 16:30:59,872 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 16:31:02,304 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 16:31:06,139 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 16:31:09,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:31:09,276 INFO L93 Difference]: Finished difference Result 1019 states and 1416 transitions. [2022-12-13 16:31:09,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-12-13 16:31:09,276 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 4.3428571428571425) internal successors, (152), 35 states have internal predecessors, (152), 14 states have call successors, (41), 6 states have call predecessors, (41), 8 states have return successors, (37), 12 states have call predecessors, (37), 14 states have call successors, (37) Word has length 125 [2022-12-13 16:31:09,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:31:09,280 INFO L225 Difference]: With dead ends: 1019 [2022-12-13 16:31:09,281 INFO L226 Difference]: Without dead ends: 860 [2022-12-13 16:31:09,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 289 SyntacticMatches, 9 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1950 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=997, Invalid=7745, Unknown=0, NotChecked=0, Total=8742 [2022-12-13 16:31:09,283 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 806 mSDsluCounter, 3560 mSDsCounter, 0 mSdLazyCounter, 6111 mSolverCounterSat, 367 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 3757 SdHoareTripleChecker+Invalid, 6481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 6111 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-12-13 16:31:09,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 3757 Invalid, 6481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 6111 Invalid, 3 Unknown, 0 Unchecked, 10.7s Time] [2022-12-13 16:31:09,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-12-13 16:31:09,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 572. [2022-12-13 16:31:09,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 425 states have (on average 1.2611764705882353) internal successors, (536), 445 states have internal predecessors, (536), 94 states have call successors, (94), 33 states have call predecessors, (94), 52 states have return successors, (135), 93 states have call predecessors, (135), 92 states have call successors, (135) [2022-12-13 16:31:09,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 765 transitions. [2022-12-13 16:31:09,359 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 765 transitions. Word has length 125 [2022-12-13 16:31:09,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:31:09,360 INFO L495 AbstractCegarLoop]: Abstraction has 572 states and 765 transitions. [2022-12-13 16:31:09,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 4.3428571428571425) internal successors, (152), 35 states have internal predecessors, (152), 14 states have call successors, (41), 6 states have call predecessors, (41), 8 states have return successors, (37), 12 states have call predecessors, (37), 14 states have call successors, (37) [2022-12-13 16:31:09,360 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 765 transitions. [2022-12-13 16:31:09,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-12-13 16:31:09,361 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:31:09,361 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:31:09,368 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 16:31:09,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 16:31:09,563 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:31:09,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:31:09,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1937163091, now seen corresponding path program 1 times [2022-12-13 16:31:09,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:31:09,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481022531] [2022-12-13 16:31:09,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:31:09,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:31:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:09,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:31:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:09,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:31:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:09,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 16:31:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:09,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:31:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:09,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:31:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:09,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 16:31:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:09,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:31:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:09,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 16:31:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:09,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 16:31:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:09,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 16:31:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:10,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:31:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:10,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 16:31:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:10,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 16:31:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:10,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-12-13 16:31:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:10,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 16:31:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:10,119 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-12-13 16:31:10,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:31:10,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481022531] [2022-12-13 16:31:10,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481022531] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:31:10,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874133637] [2022-12-13 16:31:10,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:31:10,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:31:10,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:31:10,120 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:31:10,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 16:31:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:10,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 16:31:10,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:31:10,294 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:31:10,294 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 16:31:10,304 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:31:10,304 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 16:31:12,386 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_12| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_12| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_12|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_12|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_12| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_12| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_12|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_12|) 0)))) is different from true [2022-12-13 16:31:13,214 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 50 proven. 16 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-13 16:31:13,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:31:13,547 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-12-13 16:31:13,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874133637] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:31:13,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 16:31:13,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 12] total 27 [2022-12-13 16:31:13,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810471869] [2022-12-13 16:31:13,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 16:31:13,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 16:31:13,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:31:13,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 16:31:13,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=573, Unknown=1, NotChecked=48, Total=702 [2022-12-13 16:31:13,549 INFO L87 Difference]: Start difference. First operand 572 states and 765 transitions. Second operand has 27 states, 26 states have (on average 4.923076923076923) internal successors, (128), 26 states have internal predecessors, (128), 11 states have call successors, (31), 5 states have call predecessors, (31), 7 states have return successors, (28), 10 states have call predecessors, (28), 11 states have call successors, (28) [2022-12-13 16:31:15,638 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 16:31:17,665 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 16:31:19,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 16:31:21,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:31:21,677 INFO L93 Difference]: Finished difference Result 1349 states and 1874 transitions. [2022-12-13 16:31:21,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-13 16:31:21,677 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.923076923076923) internal successors, (128), 26 states have internal predecessors, (128), 11 states have call successors, (31), 5 states have call predecessors, (31), 7 states have return successors, (28), 10 states have call predecessors, (28), 11 states have call successors, (28) Word has length 127 [2022-12-13 16:31:21,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:31:21,681 INFO L225 Difference]: With dead ends: 1349 [2022-12-13 16:31:21,681 INFO L226 Difference]: Without dead ends: 835 [2022-12-13 16:31:21,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 261 SyntacticMatches, 8 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=494, Invalid=2589, Unknown=1, NotChecked=108, Total=3192 [2022-12-13 16:31:21,685 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 385 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 1716 mSolverCounterSat, 102 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 2061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1716 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 240 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:31:21,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1603 Invalid, 2061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1716 Invalid, 3 Unknown, 240 Unchecked, 7.1s Time] [2022-12-13 16:31:21,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2022-12-13 16:31:21,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 664. [2022-12-13 16:31:21,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 507 states have (on average 1.2702169625246549) internal successors, (644), 527 states have internal predecessors, (644), 101 states have call successors, (101), 36 states have call predecessors, (101), 55 states have return successors, (148), 100 states have call predecessors, (148), 99 states have call successors, (148) [2022-12-13 16:31:21,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 893 transitions. [2022-12-13 16:31:21,834 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 893 transitions. Word has length 127 [2022-12-13 16:31:21,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:31:21,834 INFO L495 AbstractCegarLoop]: Abstraction has 664 states and 893 transitions. [2022-12-13 16:31:21,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.923076923076923) internal successors, (128), 26 states have internal predecessors, (128), 11 states have call successors, (31), 5 states have call predecessors, (31), 7 states have return successors, (28), 10 states have call predecessors, (28), 11 states have call successors, (28) [2022-12-13 16:31:21,835 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 893 transitions. [2022-12-13 16:31:21,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-12-13 16:31:21,837 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:31:21,838 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:31:21,843 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 16:31:22,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:31:22,038 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:31:22,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:31:22,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1427690001, now seen corresponding path program 1 times [2022-12-13 16:31:22,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:31:22,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074837592] [2022-12-13 16:31:22,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:31:22,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:31:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:22,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:31:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:22,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:31:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:22,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 16:31:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:22,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:31:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:22,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:31:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:22,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 16:31:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:22,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:31:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:22,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 16:31:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:22,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 16:31:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:22,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 16:31:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:22,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:31:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:22,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 16:31:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:22,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 16:31:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:22,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-12-13 16:31:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:22,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 16:31:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:22,507 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-12-13 16:31:22,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:31:22,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074837592] [2022-12-13 16:31:22,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074837592] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:31:22,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306689013] [2022-12-13 16:31:22,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:31:22,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:31:22,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:31:22,509 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:31:22,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 16:31:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:22,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 16:31:22,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:31:22,794 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-12-13 16:31:22,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:31:22,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306689013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:31:22,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:31:22,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2022-12-13 16:31:22,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352680833] [2022-12-13 16:31:22,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:31:22,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:31:22,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:31:22,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:31:22,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-12-13 16:31:22,796 INFO L87 Difference]: Start difference. First operand 664 states and 893 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-12-13 16:31:23,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:31:23,053 INFO L93 Difference]: Finished difference Result 1356 states and 1860 transitions. [2022-12-13 16:31:23,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 16:31:23,053 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 127 [2022-12-13 16:31:23,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:31:23,055 INFO L225 Difference]: With dead ends: 1356 [2022-12-13 16:31:23,055 INFO L226 Difference]: Without dead ends: 567 [2022-12-13 16:31:23,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-12-13 16:31:23,058 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 141 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:31:23,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 498 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:31:23,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2022-12-13 16:31:23,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2022-12-13 16:31:23,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 419 states have (on average 1.2100238663484486) internal successors, (507), 438 states have internal predecessors, (507), 93 states have call successors, (93), 36 states have call predecessors, (93), 54 states have return successors, (138), 92 states have call predecessors, (138), 91 states have call successors, (138) [2022-12-13 16:31:23,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 738 transitions. [2022-12-13 16:31:23,125 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 738 transitions. Word has length 127 [2022-12-13 16:31:23,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:31:23,126 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 738 transitions. [2022-12-13 16:31:23,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-12-13 16:31:23,126 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 738 transitions. [2022-12-13 16:31:23,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-12-13 16:31:23,127 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:31:23,127 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:31:23,132 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 16:31:23,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 16:31:23,328 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:31:23,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:31:23,328 INFO L85 PathProgramCache]: Analyzing trace with hash -543361001, now seen corresponding path program 1 times [2022-12-13 16:31:23,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:31:23,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483966341] [2022-12-13 16:31:23,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:31:23,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:31:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:23,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:31:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:23,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:31:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:23,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 16:31:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:23,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:31:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:23,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:31:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:23,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 16:31:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:23,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:31:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:23,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 16:31:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:23,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 16:31:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:23,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 16:31:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:23,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:31:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:23,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 16:31:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:23,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 16:31:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:23,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-12-13 16:31:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:23,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 16:31:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:23,447 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-12-13 16:31:23,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:31:23,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483966341] [2022-12-13 16:31:23,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483966341] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:31:23,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85676288] [2022-12-13 16:31:23,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:31:23,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:31:23,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:31:23,448 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:31:23,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 16:31:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:23,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 16:31:23,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:31:23,648 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 16:31:23,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:31:23,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85676288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:31:23,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:31:23,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-12-13 16:31:23,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083886795] [2022-12-13 16:31:23,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:31:23,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:31:23,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:31:23,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:31:23,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:31:23,649 INFO L87 Difference]: Start difference. First operand 567 states and 738 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 16:31:23,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:31:23,697 INFO L93 Difference]: Finished difference Result 734 states and 965 transitions. [2022-12-13 16:31:23,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:31:23,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 127 [2022-12-13 16:31:23,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:31:23,698 INFO L225 Difference]: With dead ends: 734 [2022-12-13 16:31:23,698 INFO L226 Difference]: Without dead ends: 299 [2022-12-13 16:31:23,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:31:23,700 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 3 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:31:23,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 347 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:31:23,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-12-13 16:31:23,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 295. [2022-12-13 16:31:23,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 210 states have (on average 1.1571428571428573) internal successors, (243), 217 states have internal predecessors, (243), 56 states have call successors, (56), 23 states have call predecessors, (56), 28 states have return successors, (74), 54 states have call predecessors, (74), 55 states have call successors, (74) [2022-12-13 16:31:23,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 373 transitions. [2022-12-13 16:31:23,731 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 373 transitions. Word has length 127 [2022-12-13 16:31:23,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:31:23,732 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 373 transitions. [2022-12-13 16:31:23,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 16:31:23,732 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 373 transitions. [2022-12-13 16:31:23,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-12-13 16:31:23,733 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:31:23,733 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:31:23,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 16:31:23,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 16:31:23,933 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:31:23,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:31:23,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1567955465, now seen corresponding path program 1 times [2022-12-13 16:31:23,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:31:23,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132662840] [2022-12-13 16:31:23,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:31:23,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:31:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:24,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:31:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:24,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:31:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:24,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 16:31:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:24,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:31:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:24,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 16:31:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:24,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:31:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:25,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:31:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:25,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 16:31:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:25,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 16:31:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:25,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 16:31:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:25,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 16:31:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:25,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:31:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:25,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-12-13 16:31:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:25,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-12-13 16:31:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:25,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:31:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:25,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-12-13 16:31:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:25,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-12-13 16:31:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-12-13 16:31:25,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:31:25,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132662840] [2022-12-13 16:31:25,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132662840] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:31:25,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222990094] [2022-12-13 16:31:25,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:31:25,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:31:25,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:31:25,259 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:31:25,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 16:31:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:31:25,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 130 conjunts are in the unsatisfiable core [2022-12-13 16:31:25,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:31:25,476 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:31:25,476 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 16:31:25,484 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:31:25,485 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 16:31:27,775 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_16| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_16| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_16|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_16|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_16|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_16|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_16|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_16|)))) is different from true [2022-12-13 16:31:29,887 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_17| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_17| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_17|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_17|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_17|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_17|) 8))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_17|) (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_17|)))) is different from true [2022-12-13 16:31:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 28 trivial. 33 not checked. [2022-12-13 16:31:31,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:31:43,212 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:31:53,389 WARN L233 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:31:56,161 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_node_next_is_valid_#in~node.base|) |c_aws_linked_list_node_next_is_valid_#in~node.offset|)) (.cse1 (+ 8 (select (select |c_#memory_$Pointer$.offset| |c_aws_linked_list_node_next_is_valid_#in~node.base|) |c_aws_linked_list_node_next_is_valid_#in~node.offset|)))) (and (= |c_aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1)) (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) |c_aws_linked_list_node_next_is_valid_#in~node.base|))) (and (forall ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_22| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_22| Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_22|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_22|)) (+ (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_22|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_22|) 8)) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_22|)) (forall ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_22| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_22| Int)) (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_22|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_22|)) (+ (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_22|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_22|) 8)) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_22|))) (= (mod |c_aws_linked_list_node_next_is_valid_#res| 256) 0)) is different from false [2022-12-13 16:31:56,650 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 33 proven. 48 refuted. 0 times theorem prover too weak. 71 trivial. 2 not checked. [2022-12-13 16:31:56,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222990094] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:31:56,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 16:31:56,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 33, 27] total 65 [2022-12-13 16:31:56,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437264961] [2022-12-13 16:31:56,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 16:31:56,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-12-13 16:31:56,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:31:56,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-12-13 16:31:56,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=3554, Unknown=3, NotChecked=366, Total=4160 [2022-12-13 16:31:56,654 INFO L87 Difference]: Start difference. First operand 295 states and 373 transitions. Second operand has 65 states, 61 states have (on average 3.442622950819672) internal successors, (210), 56 states have internal predecessors, (210), 20 states have call successors, (48), 8 states have call predecessors, (48), 16 states have return successors, (44), 19 states have call predecessors, (44), 20 states have call successors, (44) [2022-12-13 16:31:58,739 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 [1] [2022-12-13 16:32:01,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 16:32:45,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 16:32:48,439 WARN L837 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_node_next_is_valid_#in~node.base|) |c_aws_linked_list_node_next_is_valid_#in~node.offset|)) (.cse1 (+ 8 (select (select |c_#memory_$Pointer$.offset| |c_aws_linked_list_node_next_is_valid_#in~node.base|) |c_aws_linked_list_node_next_is_valid_#in~node.offset|)))) (and (= |c_aws_linked_list_node_next_is_valid_#in~node.offset| (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1)) (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) |c_aws_linked_list_node_next_is_valid_#in~node.base|))) (and (forall ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_22| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_22| Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_22|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_22|)) (+ (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_22|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_22|) 8)) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_22|)) (forall ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_22| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_22| Int)) (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_22|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_22|)) (+ (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_22|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_22|) 8)) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_22|))) (= (mod |c_aws_linked_list_node_next_is_valid_#res| 256) 0)) (= c_aws_linked_list_node_next_is_valid_~node.base |c_aws_linked_list_node_next_is_valid_#in~node.base|) (= c_aws_linked_list_node_next_is_valid_~node.offset |c_aws_linked_list_node_next_is_valid_#in~node.offset|)) is different from false [2022-12-13 16:32:50,753 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_17| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_17| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_17|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_17|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_17|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_17|) 8))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_17|) (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_17|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_16| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_16| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_16|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_16|)) (.cse3 (+ (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_16|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_16|) 8))) (and (= (select (select |c_#memory_$Pointer$.base| .cse2) .cse3) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_16|) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_16|))))) is different from true [2022-12-13 16:33:18,689 WARN L233 SmtUtils]: Spent 7.48s on a formula simplification. DAG size of input: 83 DAG size of output: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:33:24,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:33:24,440 INFO L93 Difference]: Finished difference Result 519 states and 672 transitions. [2022-12-13 16:33:24,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-12-13 16:33:24,441 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 61 states have (on average 3.442622950819672) internal successors, (210), 56 states have internal predecessors, (210), 20 states have call successors, (48), 8 states have call predecessors, (48), 16 states have return successors, (44), 19 states have call predecessors, (44), 20 states have call successors, (44) Word has length 149 [2022-12-13 16:33:24,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:33:24,443 INFO L225 Difference]: With dead ends: 519 [2022-12-13 16:33:24,443 INFO L226 Difference]: Without dead ends: 299 [2022-12-13 16:33:24,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 287 SyntacticMatches, 8 SemanticMatches, 135 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 4254 ImplicationChecksByTransitivity, 106.9s TimeCoverageRelationStatistics Valid=1518, Invalid=15777, Unknown=17, NotChecked=1320, Total=18632 [2022-12-13 16:33:24,446 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 538 mSDsluCounter, 2532 mSDsCounter, 0 mSdLazyCounter, 4253 mSolverCounterSat, 295 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 2633 SdHoareTripleChecker+Invalid, 5274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 4253 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 723 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:33:24,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 2633 Invalid, 5274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 4253 Invalid, 3 Unknown, 723 Unchecked, 10.1s Time] [2022-12-13 16:33:24,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-12-13 16:33:24,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 217. [2022-12-13 16:33:24,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 159 states have (on average 1.1572327044025157) internal successors, (184), 165 states have internal predecessors, (184), 34 states have call successors, (34), 17 states have call predecessors, (34), 23 states have return successors, (49), 34 states have call predecessors, (49), 33 states have call successors, (49) [2022-12-13 16:33:24,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 267 transitions. [2022-12-13 16:33:24,472 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 267 transitions. Word has length 149 [2022-12-13 16:33:24,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:33:24,472 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 267 transitions. [2022-12-13 16:33:24,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 61 states have (on average 3.442622950819672) internal successors, (210), 56 states have internal predecessors, (210), 20 states have call successors, (48), 8 states have call predecessors, (48), 16 states have return successors, (44), 19 states have call predecessors, (44), 20 states have call successors, (44) [2022-12-13 16:33:24,472 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 267 transitions. [2022-12-13 16:33:24,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-12-13 16:33:24,473 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:33:24,473 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:33:24,479 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 16:33:24,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:33:24,673 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:33:24,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:33:24,674 INFO L85 PathProgramCache]: Analyzing trace with hash 603286675, now seen corresponding path program 1 times [2022-12-13 16:33:24,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:33:24,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37955759] [2022-12-13 16:33:24,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:33:24,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:33:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:25,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:33:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:25,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:33:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:25,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 16:33:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:25,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:33:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:25,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:33:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:25,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 16:33:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:25,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:33:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:25,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 16:33:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:25,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 16:33:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:25,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 16:33:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:25,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:33:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:25,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 16:33:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:25,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 16:33:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:25,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:33:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:25,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 16:33:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:25,546 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 25 proven. 40 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-12-13 16:33:25,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:33:25,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37955759] [2022-12-13 16:33:25,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37955759] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:33:25,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076637398] [2022-12-13 16:33:25,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:33:25,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:33:25,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:33:25,548 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:33:25,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 16:33:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:25,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 16:33:25,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:33:26,073 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-12-13 16:33:26,073 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:33:26,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076637398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:33:26,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:33:26,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 24 [2022-12-13 16:33:26,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868648470] [2022-12-13 16:33:26,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:33:26,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 16:33:26,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:33:26,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 16:33:26,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2022-12-13 16:33:26,075 INFO L87 Difference]: Start difference. First operand 217 states and 267 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 16:33:26,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:33:26,805 INFO L93 Difference]: Finished difference Result 363 states and 469 transitions. [2022-12-13 16:33:26,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 16:33:26,806 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 139 [2022-12-13 16:33:26,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:33:26,807 INFO L225 Difference]: With dead ends: 363 [2022-12-13 16:33:26,807 INFO L226 Difference]: Without dead ends: 261 [2022-12-13 16:33:26,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2022-12-13 16:33:26,808 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 34 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:33:26,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 811 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 16:33:26,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-12-13 16:33:26,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 229. [2022-12-13 16:33:26,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 169 states have (on average 1.165680473372781) internal successors, (197), 176 states have internal predecessors, (197), 34 states have call successors, (34), 17 states have call predecessors, (34), 25 states have return successors, (56), 35 states have call predecessors, (56), 33 states have call successors, (56) [2022-12-13 16:33:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 287 transitions. [2022-12-13 16:33:26,835 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 287 transitions. Word has length 139 [2022-12-13 16:33:26,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:33:26,835 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 287 transitions. [2022-12-13 16:33:26,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 16:33:26,836 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 287 transitions. [2022-12-13 16:33:26,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-12-13 16:33:26,836 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:33:26,837 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:33:26,841 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-13 16:33:27,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:33:27,038 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:33:27,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:33:27,039 INFO L85 PathProgramCache]: Analyzing trace with hash -407830575, now seen corresponding path program 1 times [2022-12-13 16:33:27,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:33:27,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177485706] [2022-12-13 16:33:27,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:33:27,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:33:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:27,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:33:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:27,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:33:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:27,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 16:33:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:27,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:33:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:27,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:33:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:27,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 16:33:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:27,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:33:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:27,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 16:33:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:27,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 16:33:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:27,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 16:33:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:27,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:33:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:27,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 16:33:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:27,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 16:33:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:27,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:33:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:27,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 16:33:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:27,756 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 19 proven. 37 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-12-13 16:33:27,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:33:27,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177485706] [2022-12-13 16:33:27,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177485706] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:33:27,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931789445] [2022-12-13 16:33:27,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:33:27,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:33:27,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:33:27,757 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:33:27,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 16:33:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:27,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 16:33:27,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:33:28,121 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-12-13 16:33:28,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:33:28,317 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2022-12-13 16:33:28,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931789445] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 16:33:28,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 16:33:28,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [16, 11] total 26 [2022-12-13 16:33:28,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519635996] [2022-12-13 16:33:28,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:33:28,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:33:28,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:33:28,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:33:28,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2022-12-13 16:33:28,320 INFO L87 Difference]: Start difference. First operand 229 states and 287 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (13), 2 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 16:33:28,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:33:28,385 INFO L93 Difference]: Finished difference Result 412 states and 532 transitions. [2022-12-13 16:33:28,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:33:28,386 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (13), 2 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 139 [2022-12-13 16:33:28,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:33:28,387 INFO L225 Difference]: With dead ends: 412 [2022-12-13 16:33:28,387 INFO L226 Difference]: Without dead ends: 232 [2022-12-13 16:33:28,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 296 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2022-12-13 16:33:28,388 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:33:28,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 714 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:33:28,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-12-13 16:33:28,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2022-12-13 16:33:28,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 171 states have (on average 1.1403508771929824) internal successors, (195), 176 states have internal predecessors, (195), 34 states have call successors, (34), 17 states have call predecessors, (34), 25 states have return successors, (56), 37 states have call predecessors, (56), 33 states have call successors, (56) [2022-12-13 16:33:28,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 285 transitions. [2022-12-13 16:33:28,415 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 285 transitions. Word has length 139 [2022-12-13 16:33:28,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:33:28,415 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 285 transitions. [2022-12-13 16:33:28,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (13), 2 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 16:33:28,416 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 285 transitions. [2022-12-13 16:33:28,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-12-13 16:33:28,416 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:33:28,416 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:33:28,422 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 16:33:28,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:33:28,618 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:33:28,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:33:28,619 INFO L85 PathProgramCache]: Analyzing trace with hash -417781679, now seen corresponding path program 1 times [2022-12-13 16:33:28,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:33:28,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909115757] [2022-12-13 16:33:28,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:33:28,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:33:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:28,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:33:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:28,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:33:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:28,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 16:33:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:28,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:33:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:28,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:33:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:28,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 16:33:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:28,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:33:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:28,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 16:33:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:28,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 16:33:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:28,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 16:33:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:28,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:33:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:28,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 16:33:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:28,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 16:33:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:28,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:33:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:28,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 16:33:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:28,808 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-12-13 16:33:28,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:33:28,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909115757] [2022-12-13 16:33:28,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909115757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:33:28,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:33:28,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:33:28,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784351246] [2022-12-13 16:33:28,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:33:28,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:33:28,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:33:28,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:33:28,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:33:28,810 INFO L87 Difference]: Start difference. First operand 231 states and 285 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2022-12-13 16:33:28,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:33:28,859 INFO L93 Difference]: Finished difference Result 402 states and 511 transitions. [2022-12-13 16:33:28,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:33:28,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 139 [2022-12-13 16:33:28,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:33:28,860 INFO L225 Difference]: With dead ends: 402 [2022-12-13 16:33:28,860 INFO L226 Difference]: Without dead ends: 222 [2022-12-13 16:33:28,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:33:28,861 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 2 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:33:28,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 351 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:33:28,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-12-13 16:33:28,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2022-12-13 16:33:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 163 states have (on average 1.116564417177914) internal successors, (182), 167 states have internal predecessors, (182), 34 states have call successors, (34), 17 states have call predecessors, (34), 23 states have return successors, (48), 36 states have call predecessors, (48), 33 states have call successors, (48) [2022-12-13 16:33:28,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 264 transitions. [2022-12-13 16:33:28,886 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 264 transitions. Word has length 139 [2022-12-13 16:33:28,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:33:28,886 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 264 transitions. [2022-12-13 16:33:28,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2022-12-13 16:33:28,887 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 264 transitions. [2022-12-13 16:33:28,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-12-13 16:33:28,887 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:33:28,887 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:33:28,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 16:33:28,887 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:33:28,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:33:28,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1262928116, now seen corresponding path program 1 times [2022-12-13 16:33:28,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:33:28,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868994619] [2022-12-13 16:33:28,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:33:28,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:33:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:29,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:33:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:29,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:33:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:29,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 16:33:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:29,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:33:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:29,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:33:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:29,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 16:33:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:29,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:33:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:29,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 16:33:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:29,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 16:33:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:29,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 16:33:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:29,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:33:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:29,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 16:33:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:29,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 16:33:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:29,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:33:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:29,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 16:33:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:29,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-12-13 16:33:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:29,611 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 19 proven. 24 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-12-13 16:33:29,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:33:29,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868994619] [2022-12-13 16:33:29,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868994619] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:33:29,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8598318] [2022-12-13 16:33:29,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:33:29,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:33:29,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:33:29,612 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:33:29,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 16:33:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:33:29,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-13 16:33:29,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:33:29,812 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:33:29,812 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 16:33:29,823 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 16:33:29,823 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 16:33:31,917 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_24|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_24|) 0)))) is different from true [2022-12-13 16:33:33,605 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 68 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 7 not checked. [2022-12-13 16:33:33,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:33:34,579 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 20 proven. 23 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-12-13 16:33:34,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8598318] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:33:34,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 16:33:34,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 16] total 41 [2022-12-13 16:33:34,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660886518] [2022-12-13 16:33:34,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 16:33:34,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-13 16:33:34,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:33:34,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-13 16:33:34,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1428, Unknown=1, NotChecked=76, Total=1640 [2022-12-13 16:33:34,581 INFO L87 Difference]: Start difference. First operand 221 states and 264 transitions. Second operand has 41 states, 40 states have (on average 4.15) internal successors, (166), 40 states have internal predecessors, (166), 14 states have call successors, (34), 5 states have call predecessors, (34), 9 states have return successors, (32), 12 states have call predecessors, (32), 14 states have call successors, (32) [2022-12-13 16:33:36,780 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 16:33:38,847 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 16:33:40,900 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 16:33:49,435 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:33:55,517 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:34:01,595 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:34:03,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:34:03,997 INFO L93 Difference]: Finished difference Result 364 states and 449 transitions. [2022-12-13 16:34:03,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-13 16:34:03,997 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 4.15) internal successors, (166), 40 states have internal predecessors, (166), 14 states have call successors, (34), 5 states have call predecessors, (34), 9 states have return successors, (32), 12 states have call predecessors, (32), 14 states have call successors, (32) Word has length 140 [2022-12-13 16:34:03,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:34:03,998 INFO L225 Difference]: With dead ends: 364 [2022-12-13 16:34:03,998 INFO L226 Difference]: Without dead ends: 250 [2022-12-13 16:34:03,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 281 SyntacticMatches, 10 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=533, Invalid=4025, Unknown=2, NotChecked=132, Total=4692 [2022-12-13 16:34:03,999 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 362 mSDsluCounter, 1547 mSDsCounter, 0 mSdLazyCounter, 2313 mSolverCounterSat, 128 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1650 SdHoareTripleChecker+Invalid, 2629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 2313 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 185 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:34:04,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1650 Invalid, 2629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 2313 Invalid, 3 Unknown, 185 Unchecked, 8.0s Time] [2022-12-13 16:34:04,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-12-13 16:34:04,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 224. [2022-12-13 16:34:04,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 165 states have (on average 1.1151515151515152) internal successors, (184), 170 states have internal predecessors, (184), 34 states have call successors, (34), 17 states have call predecessors, (34), 24 states have return successors, (52), 36 states have call predecessors, (52), 33 states have call successors, (52) [2022-12-13 16:34:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 270 transitions. [2022-12-13 16:34:04,034 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 270 transitions. Word has length 140 [2022-12-13 16:34:04,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:34:04,034 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 270 transitions. [2022-12-13 16:34:04,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 4.15) internal successors, (166), 40 states have internal predecessors, (166), 14 states have call successors, (34), 5 states have call predecessors, (34), 9 states have return successors, (32), 12 states have call predecessors, (32), 14 states have call successors, (32) [2022-12-13 16:34:04,035 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 270 transitions. [2022-12-13 16:34:04,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-12-13 16:34:04,035 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:34:04,035 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:34:04,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-13 16:34:04,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 16:34:04,237 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:34:04,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:34:04,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1772401206, now seen corresponding path program 1 times [2022-12-13 16:34:04,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:34:04,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451480657] [2022-12-13 16:34:04,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:34:04,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:34:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:04,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:34:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:04,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:34:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:04,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 16:34:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:04,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:34:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:04,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:34:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:04,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 16:34:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:04,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:34:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:04,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 16:34:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:04,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 16:34:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:04,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 16:34:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:04,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:34:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:04,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 16:34:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:04,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 16:34:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:04,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:34:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:04,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 16:34:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:04,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-12-13 16:34:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:04,787 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 19 proven. 17 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-12-13 16:34:04,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:34:04,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451480657] [2022-12-13 16:34:04,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451480657] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:34:04,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007418212] [2022-12-13 16:34:04,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:34:04,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:34:04,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:34:04,788 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:34:04,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 16:34:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:04,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 16:34:04,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:34:05,170 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-12-13 16:34:05,171 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:34:05,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007418212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:34:05,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:34:05,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 22 [2022-12-13 16:34:05,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192099581] [2022-12-13 16:34:05,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:34:05,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 16:34:05,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:34:05,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 16:34:05,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2022-12-13 16:34:05,173 INFO L87 Difference]: Start difference. First operand 224 states and 270 transitions. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-12-13 16:34:05,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:34:05,555 INFO L93 Difference]: Finished difference Result 346 states and 425 transitions. [2022-12-13 16:34:05,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 16:34:05,556 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 140 [2022-12-13 16:34:05,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:34:05,557 INFO L225 Difference]: With dead ends: 346 [2022-12-13 16:34:05,557 INFO L226 Difference]: Without dead ends: 225 [2022-12-13 16:34:05,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=828, Unknown=0, NotChecked=0, Total=930 [2022-12-13 16:34:05,558 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 159 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:34:05,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 671 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:34:05,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-12-13 16:34:05,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 220. [2022-12-13 16:34:05,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 162 states have (on average 1.117283950617284) internal successors, (181), 167 states have internal predecessors, (181), 34 states have call successors, (34), 17 states have call predecessors, (34), 23 states have return successors, (48), 35 states have call predecessors, (48), 33 states have call successors, (48) [2022-12-13 16:34:05,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 263 transitions. [2022-12-13 16:34:05,584 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 263 transitions. Word has length 140 [2022-12-13 16:34:05,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:34:05,584 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 263 transitions. [2022-12-13 16:34:05,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-12-13 16:34:05,584 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 263 transitions. [2022-12-13 16:34:05,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-12-13 16:34:05,585 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:34:05,585 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:34:05,590 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 16:34:05,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-13 16:34:05,786 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:34:05,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:34:05,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1580915293, now seen corresponding path program 1 times [2022-12-13 16:34:05,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:34:05,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335748421] [2022-12-13 16:34:05,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:34:05,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:34:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:05,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:34:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:05,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:34:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:05,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 16:34:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:05,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:34:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:05,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:34:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:05,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 16:34:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:05,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:34:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:05,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 16:34:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:05,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 16:34:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:05,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 16:34:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:05,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:34:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:05,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 16:34:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:05,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 16:34:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:05,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-12-13 16:34:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:05,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 16:34:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:06,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-12-13 16:34:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:06,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-12-13 16:34:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:06,075 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-12-13 16:34:06,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:34:06,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335748421] [2022-12-13 16:34:06,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335748421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:34:06,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:34:06,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:34:06,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13812532] [2022-12-13 16:34:06,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:34:06,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:34:06,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:34:06,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:34:06,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:34:06,077 INFO L87 Difference]: Start difference. First operand 220 states and 263 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 16:34:06,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:34:06,170 INFO L93 Difference]: Finished difference Result 325 states and 397 transitions. [2022-12-13 16:34:06,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:34:06,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 141 [2022-12-13 16:34:06,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:34:06,173 INFO L225 Difference]: With dead ends: 325 [2022-12-13 16:34:06,173 INFO L226 Difference]: Without dead ends: 227 [2022-12-13 16:34:06,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:34:06,174 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 7 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:34:06,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 450 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:34:06,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-12-13 16:34:06,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2022-12-13 16:34:06,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 163 states have (on average 1.116564417177914) internal successors, (182), 168 states have internal predecessors, (182), 36 states have call successors, (36), 17 states have call predecessors, (36), 23 states have return successors, (50), 37 states have call predecessors, (50), 35 states have call successors, (50) [2022-12-13 16:34:06,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 268 transitions. [2022-12-13 16:34:06,225 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 268 transitions. Word has length 141 [2022-12-13 16:34:06,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:34:06,225 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 268 transitions. [2022-12-13 16:34:06,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 16:34:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 268 transitions. [2022-12-13 16:34:06,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-12-13 16:34:06,226 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:34:06,226 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:34:06,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 16:34:06,227 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:34:06,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:34:06,227 INFO L85 PathProgramCache]: Analyzing trace with hash 378541657, now seen corresponding path program 1 times [2022-12-13 16:34:06,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:34:06,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305551337] [2022-12-13 16:34:06,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:34:06,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:34:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:06,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:34:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:06,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 16:34:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:06,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 16:34:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:06,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:34:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:06,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 16:34:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:06,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 16:34:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:06,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:34:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:06,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 16:34:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:06,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 16:34:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:06,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 16:34:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:06,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:34:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:06,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 16:34:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:06,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 16:34:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:06,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-12-13 16:34:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:06,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 16:34:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:06,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-12-13 16:34:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:06,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-12-13 16:34:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:34:06,546 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-12-13 16:34:06,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:34:06,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305551337] [2022-12-13 16:34:06,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305551337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:34:06,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:34:06,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:34:06,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259915187] [2022-12-13 16:34:06,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:34:06,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:34:06,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:34:06,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:34:06,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:34:06,548 INFO L87 Difference]: Start difference. First operand 223 states and 268 transitions. Second operand has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-12-13 16:34:06,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:34:06,646 INFO L93 Difference]: Finished difference Result 231 states and 276 transitions. [2022-12-13 16:34:06,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:34:06,647 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 141 [2022-12-13 16:34:06,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:34:06,648 INFO L225 Difference]: With dead ends: 231 [2022-12-13 16:34:06,649 INFO L226 Difference]: Without dead ends: 229 [2022-12-13 16:34:06,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:34:06,649 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 5 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:34:06,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 717 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:34:06,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-12-13 16:34:06,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 228. [2022-12-13 16:34:06,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 166 states have (on average 1.1144578313253013) internal successors, (185), 171 states have internal predecessors, (185), 37 states have call successors, (37), 18 states have call predecessors, (37), 24 states have return successors, (51), 38 states have call predecessors, (51), 36 states have call successors, (51) [2022-12-13 16:34:06,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 273 transitions. [2022-12-13 16:34:06,684 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 273 transitions. Word has length 141 [2022-12-13 16:34:06,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:34:06,684 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 273 transitions. [2022-12-13 16:34:06,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2022-12-13 16:34:06,684 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 273 transitions. [2022-12-13 16:34:06,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-12-13 16:34:06,685 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:34:06,685 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:34:06,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 16:34:06,685 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:34:06,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:34:06,685 INFO L85 PathProgramCache]: Analyzing trace with hash -707550403, now seen corresponding path program 1 times [2022-12-13 16:34:06,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:34:06,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285734474] [2022-12-13 16:34:06,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:34:06,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:34:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:34:06,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 16:34:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:34:06,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 16:34:06,814 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 16:34:06,814 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 16:34:06,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 16:34:06,818 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:34:06,821 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 16:34:06,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:34:06 BoogieIcfgContainer [2022-12-13 16:34:06,869 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 16:34:06,869 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 16:34:06,870 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 16:34:06,870 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 16:34:06,870 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:30:14" (3/4) ... [2022-12-13 16:34:06,871 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 16:34:06,916 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 16:34:06,916 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 16:34:06,917 INFO L158 Benchmark]: Toolchain (without parser) took 235309.35ms. Allocated memory was 121.6MB in the beginning and 255.9MB in the end (delta: 134.2MB). Free memory was 75.6MB in the beginning and 100.7MB in the end (delta: -25.1MB). Peak memory consumption was 111.7MB. Max. memory is 16.1GB. [2022-12-13 16:34:06,917 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 121.6MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:34:06,917 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1791.22ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 75.2MB in the beginning and 55.0MB in the end (delta: 20.1MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB. [2022-12-13 16:34:06,917 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.45ms. Allocated memory is still 146.8MB. Free memory was 55.0MB in the beginning and 99.2MB in the end (delta: -44.1MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2022-12-13 16:34:06,918 INFO L158 Benchmark]: Boogie Preprocessor took 47.79ms. Allocated memory is still 146.8MB. Free memory was 99.2MB in the beginning and 95.9MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 16:34:06,918 INFO L158 Benchmark]: RCFGBuilder took 474.27ms. Allocated memory is still 146.8MB. Free memory was 95.9MB in the beginning and 70.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-13 16:34:06,918 INFO L158 Benchmark]: TraceAbstraction took 232835.58ms. Allocated memory was 146.8MB in the beginning and 255.9MB in the end (delta: 109.1MB). Free memory was 69.8MB in the beginning and 109.1MB in the end (delta: -39.3MB). Peak memory consumption was 70.5MB. Max. memory is 16.1GB. [2022-12-13 16:34:06,918 INFO L158 Benchmark]: Witness Printer took 46.64ms. Allocated memory is still 255.9MB. Free memory was 108.0MB in the beginning and 100.7MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-13 16:34:06,920 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 121.6MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1791.22ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 75.2MB in the beginning and 55.0MB in the end (delta: 20.1MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.45ms. Allocated memory is still 146.8MB. Free memory was 55.0MB in the beginning and 99.2MB in the end (delta: -44.1MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.79ms. Allocated memory is still 146.8MB. Free memory was 99.2MB in the beginning and 95.9MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 474.27ms. Allocated memory is still 146.8MB. Free memory was 95.9MB in the beginning and 70.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 232835.58ms. Allocated memory was 146.8MB in the beginning and 255.9MB in the end (delta: 109.1MB). Free memory was 69.8MB in the beginning and 109.1MB in the end (delta: -39.3MB). Peak memory consumption was 70.5MB. Max. memory is 16.1GB. * Witness Printer took 46.64ms. Allocated memory is still 255.9MB. Free memory was 108.0MB in the beginning and 100.7MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 223]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L6913-L6918] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7358] static __thread int tl_last_error = 0; VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7395] CALL aws_linked_list_back_harness() [L7376] struct aws_linked_list list; [L7378] CALL ensure_linked_list_is_allocated(&list, 20) [L6755] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L266] return __VERIFIER_nondet_ulong(); [L6755] RET, EXPR nondet_uint64_t() VAL [\old(max_length)=20, list={6:0}, list={6:0}, max_length=20, nondet_uint64_t()=18446744073709551617, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6755] size_t length = nondet_uint64_t(); [L6756] CALL assume_abort_if_not(length <= max_length) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6756] RET assume_abort_if_not(length <= max_length) VAL [\old(max_length)=20, length=1, list={6:0}, list={6:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6758-L6759] list->head.prev = ((void *)0) [L6761-L6762] list->tail.next = ((void *)0) [L6765] struct aws_linked_list_node *curr = &list->head; [L6767] size_t i = 0; VAL [\old(max_length)=20, curr={6:0}, i=0, length=1, list={6:0}, list={6:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6767] COND TRUE i < length [L6770] struct aws_linked_list_node *node = malloc(sizeof(struct aws_linked_list_node)); [L6771] curr->next = node [L6772] node->prev = curr [L6773] curr = node VAL [\old(max_length)=20, curr={-2:0}, i=0, length=1, list={6:0}, list={6:0}, max_length=20, node={-2:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6767] i++ VAL [\old(max_length)=20, curr={-2:0}, i=1, length=1, list={6:0}, list={6:0}, max_length=20, node={-2:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6767] COND FALSE !(i < length) VAL [\old(max_length)=20, curr={-2:0}, i=1, length=1, list={6:0}, list={6:0}, max_length=20, node={-2:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6776] curr->next = &list->tail [L6777] list->tail.prev = curr VAL [\old(max_length)=20, curr={-2:0}, i=1, length=1, list={6:0}, list={6:0}, max_length=20, node={-2:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7378] RET ensure_linked_list_is_allocated(&list, 20) [L7381] EXPR list.tail.prev [L7381] struct aws_linked_list_node *old_last = list.tail.prev; [L7384] CALL, EXPR aws_linked_list_empty(&list) VAL [list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4684] CALL assume_abort_if_not((list)) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4684] RET assume_abort_if_not((list)) VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4685] EXPR list->head.next [L4685] return list->head.next == &list->tail; [L7384] RET, EXPR aws_linked_list_empty(&list) VAL [aws_linked_list_empty(&list)=0, list={6:0}, old_last={-2:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7384] CALL assume_abort_if_not(!aws_linked_list_empty(&list)) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7384] RET assume_abort_if_not(!aws_linked_list_empty(&list)) VAL [aws_linked_list_empty(&list)=0, list={6:0}, old_last={-2:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7387] CALL aws_linked_list_back(&list) VAL [list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4960] CALL, EXPR aws_linked_list_is_valid(list) VAL [list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next [L4694] EXPR list->head.next [L4694] EXPR list && list->head.next VAL [list={6:0}, list={6:0}, list && list->head.next=1, list->head.next={-2:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694] EXPR list->head.prev [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [list={6:0}, list={6:0}, list && list->head.next=1, list && list->head.next && list->head.prev == ((void *)0)=1, list->head.next={-2:0}, list->head.prev={0:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4696] EXPR list->tail.prev [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [list={6:0}, list={6:0}, list && list->head.next=1, list && list->head.next && list->head.prev == ((void *)0)=1, list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev=1, list->head.next={-2:0}, list->head.prev={0:0}, list->tail.prev={-2:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4696] EXPR list->tail.next [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [list={6:0}, list={6:0}, list && list->head.next=1, list && list->head.next && list->head.prev == ((void *)0)=1, list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev=1, list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0)=1, list->head.next={-2:0}, list->head.prev={0:0}, list->tail.next={0:0}, list->tail.prev={-2:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] COND TRUE list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4700] CALL, EXPR aws_linked_list_is_valid_deep(list) [L4734] COND FALSE !(!list) [L4740] const struct aws_linked_list_node *temp = &list->head; [L4743-L4746] _Bool head_reaches_tail = 0 ; VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4751] COND FALSE !(temp == &list->tail) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [node={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next [L4718] EXPR node->next [L4718] EXPR node && node->next VAL [node={6:0}, node={6:0}, node && node->next=1, node->next={-2:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node [L4718] EXPR node->next [L4718] EXPR node->next->prev [L4718] EXPR node && node->next && node->next->prev == node VAL [node={6:0}, node={6:0}, node && node->next=1, node && node->next && node->next->prev == node=1, node->next={-2:0}, node->next={-2:0}, node->next->prev={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] return node && node->next && node->next->prev == node; [L4756] RET, EXPR aws_linked_list_node_next_is_valid(temp) VAL [aws_linked_list_node_next_is_valid(temp)=1, head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4756] COND FALSE !(!aws_linked_list_node_next_is_valid(temp)) [L4762] EXPR temp->next [L4762] temp = temp->next [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={-2:0}, tl_last_error=0] [L4751] COND FALSE !(temp == &list->tail) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={-2:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [node={-2:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next [L4718] EXPR node->next [L4718] EXPR node && node->next VAL [node={-2:0}, node={-2:0}, node && node->next=1, node->next={6:16}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node [L4718] EXPR node->next [L4718] EXPR node->next->prev [L4718] EXPR node && node->next && node->next->prev == node VAL [node={-2:0}, node={-2:0}, node && node->next=1, node && node->next && node->next->prev == node=1, node->next={6:16}, node->next={6:16}, node->next->prev={-2:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] return node && node->next && node->next->prev == node; [L4756] RET, EXPR aws_linked_list_node_next_is_valid(temp) VAL [aws_linked_list_node_next_is_valid(temp)=1, head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={-2:0}, tl_last_error=0] [L4756] COND FALSE !(!aws_linked_list_node_next_is_valid(temp)) [L4762] EXPR temp->next [L4762] temp = temp->next [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:16}, tl_last_error=0] [L4751] COND TRUE temp == &list->tail [L4752-L4753] head_reaches_tail = 1 VAL [head_reaches_tail=1, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:16}, tl_last_error=0] [L4764] return head_reaches_tail; VAL [\result=1, head_reaches_tail=1, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:16}, tl_last_error=0] [L4700] RET, EXPR aws_linked_list_is_valid_deep(list) [L4700] return aws_linked_list_is_valid_deep(list); [L4960] RET, EXPR aws_linked_list_is_valid(list) VAL [aws_linked_list_is_valid(list)=1, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4960] CALL assume_abort_if_not((aws_linked_list_is_valid(list))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4960] RET assume_abort_if_not((aws_linked_list_is_valid(list))) VAL [aws_linked_list_is_valid(list)=1, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4961] CALL, EXPR aws_linked_list_empty(list) VAL [list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4684] CALL assume_abort_if_not((list)) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4684] RET assume_abort_if_not((list)) VAL [list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4685] EXPR list->head.next [L4685] return list->head.next == &list->tail; [L4961] RET, EXPR aws_linked_list_empty(list) VAL [aws_linked_list_empty(list)=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4961] CALL assume_abort_if_not((!aws_linked_list_empty(list))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4961] RET assume_abort_if_not((!aws_linked_list_empty(list))) VAL [aws_linked_list_empty(list)=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4962] EXPR list->tail.prev [L4962] struct aws_linked_list_node *rval = list->tail.prev; [L4963] CALL, EXPR aws_linked_list_is_valid(list) VAL [list={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next [L4694] EXPR list->head.next [L4694] EXPR list && list->head.next VAL [list={6:0}, list={6:0}, list && list->head.next=1, list->head.next={-2:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694] EXPR list->head.prev [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [list={6:0}, list={6:0}, list && list->head.next=1, list && list->head.next && list->head.prev == ((void *)0)=1, list->head.next={-2:0}, list->head.prev={0:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4696] EXPR list->tail.prev [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [list={6:0}, list={6:0}, list && list->head.next=1, list && list->head.next && list->head.prev == ((void *)0)=1, list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev=1, list->head.next={-2:0}, list->head.prev={0:0}, list->tail.prev={-2:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4696] EXPR list->tail.next [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [list={6:0}, list={6:0}, list && list->head.next=1, list && list->head.next && list->head.prev == ((void *)0)=1, list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev=1, list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0)=1, list->head.next={-2:0}, list->head.prev={0:0}, list->tail.next={0:0}, list->tail.prev={-2:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] COND TRUE list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4700] CALL, EXPR aws_linked_list_is_valid_deep(list) [L4734] COND FALSE !(!list) [L4740] const struct aws_linked_list_node *temp = &list->head; [L4743-L4746] _Bool head_reaches_tail = 0 ; VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4751] COND FALSE !(temp == &list->tail) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [node={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next [L4718] EXPR node->next [L4718] EXPR node && node->next VAL [node={6:0}, node={6:0}, node && node->next=1, node->next={-2:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node [L4718] EXPR node->next [L4718] EXPR node->next->prev [L4718] EXPR node && node->next && node->next->prev == node VAL [node={6:0}, node={6:0}, node && node->next=1, node && node->next && node->next->prev == node=1, node->next={-2:0}, node->next={-2:0}, node->next->prev={6:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] return node && node->next && node->next->prev == node; [L4756] RET, EXPR aws_linked_list_node_next_is_valid(temp) VAL [aws_linked_list_node_next_is_valid(temp)=1, head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:0}, tl_last_error=0] [L4756] COND FALSE !(!aws_linked_list_node_next_is_valid(temp)) [L4762] EXPR temp->next [L4762] temp = temp->next [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={-2:0}, tl_last_error=0] [L4751] COND FALSE !(temp == &list->tail) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={-2:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [node={-2:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next [L4718] EXPR node->next [L4718] EXPR node && node->next VAL [node={-2:0}, node={-2:0}, node && node->next=1, node->next={6:16}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node [L4718] EXPR node->next [L4718] EXPR node->next->prev [L4718] EXPR node && node->next && node->next->prev == node VAL [node={-2:0}, node={-2:0}, node && node->next=1, node && node->next && node->next->prev == node=1, node->next={6:16}, node->next={6:16}, node->next->prev={-2:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] return node && node->next && node->next->prev == node; [L4756] RET, EXPR aws_linked_list_node_next_is_valid(temp) VAL [aws_linked_list_node_next_is_valid(temp)=1, head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={-2:0}, tl_last_error=0] [L4756] COND FALSE !(!aws_linked_list_node_next_is_valid(temp)) [L4762] EXPR temp->next [L4762] temp = temp->next [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:16}, tl_last_error=0] [L4751] COND TRUE temp == &list->tail [L4752-L4753] head_reaches_tail = 1 VAL [head_reaches_tail=1, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:16}, tl_last_error=0] [L4764] return head_reaches_tail; VAL [\result=1, head_reaches_tail=1, list={6:0}, list={6:0}, s_can_fail_allocator_static={4:0}, temp={6:16}, tl_last_error=0] [L4700] RET, EXPR aws_linked_list_is_valid_deep(list) [L4700] return aws_linked_list_is_valid_deep(list); [L4963] RET, EXPR aws_linked_list_is_valid(list) VAL [aws_linked_list_is_valid(list)=1, list={6:0}, list={6:0}, rval={-2:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4963] CALL __VERIFIER_assert(!((aws_linked_list_is_valid(list)))) VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L223] COND TRUE !cond VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L223] reach_error() VAL [\old(cond)=0, cond=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 232.7s, OverallIterations: 27, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 162.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 15 mSolverCounterUnknown, 4165 SdHoareTripleChecker+Valid, 48.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4101 mSDsluCounter, 26011 SdHoareTripleChecker+Invalid, 46.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1148 IncrementalHoareTripleChecker+Unchecked, 22928 mSDsCounter, 1686 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23262 IncrementalHoareTripleChecker+Invalid, 26111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1686 mSolverCounterUnsat, 3083 mSDtfsCounter, 23262 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4714 GetRequests, 3807 SyntacticMatches, 47 SemanticMatches, 860 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 20265 ImplicationChecksByTransitivity, 155.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=664occurred in iteration=16, InterpolantAutomatonStates: 562, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 848 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 61.2s InterpolantComputationTime, 5453 NumberOfCodeBlocks, 5453 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 6294 ConstructedInterpolants, 271 QuantifiedInterpolants, 32807 SizeOfPredicates, 222 NumberOfNonLiveVariables, 9469 ConjunctsInSsa, 675 ConjunctsInUnsatCore, 53 InterpolantComputations, 20 PerfectInterpolantSequences, 4818/5431 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 16:34:06,988 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8e76921-f47d-493a-9b5f-a28f1ca97091/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE