./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R --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 a49fa15b0860d2357f9ad3c8c6bab1d80cf83a6734355dc0b05c55121c837273 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:10:24,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:10:24,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:10:24,622 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:10:24,623 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:10:24,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:10:24,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:10:24,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:10:24,630 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:10:24,631 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:10:24,633 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:10:24,635 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:10:24,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:10:24,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:10:24,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:10:24,640 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:10:24,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:10:24,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:10:24,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:10:24,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:10:24,649 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:10:24,653 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:10:24,655 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:10:24,656 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:10:24,660 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:10:24,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:10:24,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:10:24,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:10:24,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:10:24,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:10:24,674 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:10:24,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:10:24,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:10:24,678 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:10:24,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:10:24,681 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:10:24,682 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:10:24,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:10:24,683 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:10:24,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:10:24,687 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:10:24,688 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-25 18:10:24,737 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:10:24,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:10:24,738 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:10:24,738 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:10:24,739 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:10:24,739 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:10:24,740 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:10:24,740 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:10:24,741 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:10:24,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:10:24,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:10:24,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:10:24,742 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:10:24,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:10:24,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:10:24,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:10:24,743 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:10:24,743 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:10:24,743 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:10:24,744 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:10:24,744 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:10:24,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:10:24,744 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:10:24,745 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:10:24,745 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:10:24,745 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:10:24,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:10:24,746 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:10:24,746 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:10:24,746 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:10:24,747 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:10:24,747 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_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/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_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R 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 -> a49fa15b0860d2357f9ad3c8c6bab1d80cf83a6734355dc0b05c55121c837273 [2022-11-25 18:10:25,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:10:25,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:10:25,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:10:25,069 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:10:25,069 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:10:25,071 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i [2022-11-25 18:10:28,719 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:10:29,407 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:10:29,408 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i [2022-11-25 18:10:29,451 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/data/96afa112e/87153e6ccbf745d99dae11027a641e90/FLAGee1037609 [2022-11-25 18:10:29,470 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/data/96afa112e/87153e6ccbf745d99dae11027a641e90 [2022-11-25 18:10:29,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:10:29,477 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:10:29,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:10:29,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:10:29,488 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:10:29,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:10:29" (1/1) ... [2022-11-25 18:10:29,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a64a5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:29, skipping insertion in model container [2022-11-25 18:10:29,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:10:29" (1/1) ... [2022-11-25 18:10:29,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:10:29,599 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:10:29,852 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_e63e3355-2aaf-42e6-9312-f995a7e9a23b/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i[4493,4506] [2022-11-25 18:10:29,861 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_e63e3355-2aaf-42e6-9312-f995a7e9a23b/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i[4553,4566] [2022-11-25 18:10:31,013 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 18:10:31,022 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:31,030 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:31,031 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:31,033 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:31,036 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:31,056 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:31,065 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:31,072 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:31,074 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:31,078 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:31,080 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:31,081 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:31,083 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:31,219 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:10:31,220 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:10:31,222 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:10:31,245 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 18:10:31,251 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 18:10:31,252 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 18:10:31,631 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 18:10:31,633 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 18:10:31,675 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 18:10:31,676 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 18:10:31,677 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 18:10:31,679 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 18:10:31,680 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 18:10:31,681 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 18:10:31,681 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 18:10:31,683 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 18:10:31,696 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 18:10:31,910 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 18:10:31,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:10:31,993 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:10:32,031 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_e63e3355-2aaf-42e6-9312-f995a7e9a23b/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i[4493,4506] [2022-11-25 18:10:32,032 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_e63e3355-2aaf-42e6-9312-f995a7e9a23b/sv-benchmarks/c/aws-c-common/aws_linked_list_end_harness.i[4553,4566] [2022-11-25 18:10:32,109 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-11-25 18:10:32,121 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:32,122 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:32,122 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:32,123 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:32,124 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:32,135 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:32,136 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:32,137 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:32,138 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:32,143 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:32,144 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:32,145 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:32,145 WARN L1576 CHandler]: Possible shadowing of function index [2022-11-25 18:10:32,167 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:10:32,167 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:10:32,169 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-11-25 18:10:32,183 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-11-25 18:10:32,185 WARN L623 FunctionHandler]: Unknown extern function htons [2022-11-25 18:10:32,185 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-11-25 18:10:32,228 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-11-25 18:10:32,229 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-25 18:10:32,230 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-25 18:10:32,231 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-25 18:10:32,232 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-25 18:10:32,233 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-25 18:10:32,234 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-25 18:10:32,235 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-25 18:10:32,235 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-25 18:10:32,236 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-25 18:10:32,236 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-25 18:10:32,279 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-25 18:10:32,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:10:32,666 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:10:32,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:32 WrapperNode [2022-11-25 18:10:32,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:10:32,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:10:32,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:10:32,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:10:32,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:32" (1/1) ... [2022-11-25 18:10:32,756 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:32" (1/1) ... [2022-11-25 18:10:32,811 INFO L138 Inliner]: procedures = 679, calls = 1039, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 135 [2022-11-25 18:10:32,812 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:10:32,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:10:32,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:10:32,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:10:32,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:32" (1/1) ... [2022-11-25 18:10:32,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:32" (1/1) ... [2022-11-25 18:10:32,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:32" (1/1) ... [2022-11-25 18:10:32,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:32" (1/1) ... [2022-11-25 18:10:32,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:32" (1/1) ... [2022-11-25 18:10:32,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:32" (1/1) ... [2022-11-25 18:10:32,852 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:32" (1/1) ... [2022-11-25 18:10:32,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:32" (1/1) ... [2022-11-25 18:10:32,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:10:32,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:10:32,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:10:32,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:10:32,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:32" (1/1) ... [2022-11-25 18:10:32,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:10:32,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:10:32,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:10:32,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:10:32,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:10:32,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 18:10:32,965 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 18:10:32,966 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-11-25 18:10:32,966 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-11-25 18:10:32,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 18:10:32,967 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-11-25 18:10:32,967 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-11-25 18:10:32,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:10:32,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 18:10:32,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:10:32,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:10:32,969 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 18:10:32,969 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 18:10:32,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:10:32,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 18:10:32,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 18:10:32,970 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-25 18:10:32,970 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-25 18:10:32,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:10:33,392 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:10:33,396 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:10:33,711 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:10:33,719 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:10:33,720 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 18:10:33,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:10:33 BoogieIcfgContainer [2022-11-25 18:10:33,723 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:10:33,725 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:10:33,726 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:10:33,731 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:10:33,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:10:29" (1/3) ... [2022-11-25 18:10:33,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c6c81a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:10:33, skipping insertion in model container [2022-11-25 18:10:33,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:10:32" (2/3) ... [2022-11-25 18:10:33,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c6c81a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:10:33, skipping insertion in model container [2022-11-25 18:10:33,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:10:33" (3/3) ... [2022-11-25 18:10:33,739 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_end_harness.i [2022-11-25 18:10:33,764 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:10:33,764 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 18:10:33,833 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:10:33,841 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;@4533425f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:10:33,841 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 18:10:33,847 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 49 states have internal predecessors, (65), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 18:10:33,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-25 18:10:33,860 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:10:33,861 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:10:33,862 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:10:33,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:10:33,869 INFO L85 PathProgramCache]: Analyzing trace with hash -2107862704, now seen corresponding path program 1 times [2022-11-25 18:10:33,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:10:33,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124415006] [2022-11-25 18:10:33,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:33,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:10:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:34,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:10:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:34,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:10:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:34,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:10:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:34,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:10:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:34,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:10:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:34,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 18:10:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:34,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-25 18:10:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:34,688 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-25 18:10:34,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:10:34,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124415006] [2022-11-25 18:10:34,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124415006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:10:34,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:10:34,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:10:34,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152474446] [2022-11-25 18:10:34,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:10:34,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:10:34,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:10:34,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:10:34,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:10:34,739 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 49 states have internal predecessors, (65), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 18:10:34,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:10:34,810 INFO L93 Difference]: Finished difference Result 128 states and 184 transitions. [2022-11-25 18:10:34,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:10:34,813 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2022-11-25 18:10:34,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:10:34,825 INFO L225 Difference]: With dead ends: 128 [2022-11-25 18:10:34,825 INFO L226 Difference]: Without dead ends: 63 [2022-11-25 18:10:34,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 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-11-25 18:10:34,838 INFO L413 NwaCegarLoop]: 87 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, 87 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-11-25 18:10:34,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:10:34,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-25 18:10:34,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-25 18:10:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 18:10:34,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2022-11-25 18:10:34,889 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 68 [2022-11-25 18:10:34,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:10:34,890 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2022-11-25 18:10:34,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 18:10:34,891 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2022-11-25 18:10:34,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-25 18:10:34,894 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:10:34,894 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:10:34,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:10:34,895 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:10:34,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:10:34,896 INFO L85 PathProgramCache]: Analyzing trace with hash 900796622, now seen corresponding path program 1 times [2022-11-25 18:10:34,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:10:34,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610663977] [2022-11-25 18:10:34,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:34,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:10:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:35,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:10:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:35,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:10:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:35,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:10:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:35,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:10:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:35,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:10:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:35,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 18:10:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:35,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-25 18:10:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:35,746 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-25 18:10:35,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:10:35,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610663977] [2022-11-25 18:10:35,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610663977] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:10:35,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331483834] [2022-11-25 18:10:35,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:35,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:35,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:10:35,753 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:10:35,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 18:10:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:36,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-25 18:10:36,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:10:36,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-25 18:10:36,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-25 18:10:36,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:36,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:36,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-11-25 18:10:36,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:36,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:36,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-11-25 18:10:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-25 18:10:38,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:10:38,981 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 738 treesize of output 726 [2022-11-25 18:10:39,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:39,237 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:10:39,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:39,293 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-25 18:10:39,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331483834] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 18:10:39,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:10:39,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6, 10] total 21 [2022-11-25 18:10:39,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721168190] [2022-11-25 18:10:39,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:10:39,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:10:39,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:10:39,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:10:39,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=361, Unknown=1, NotChecked=0, Total=420 [2022-11-25 18:10:39,298 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 18:10:40,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:10:40,839 INFO L93 Difference]: Finished difference Result 133 states and 186 transitions. [2022-11-25 18:10:40,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:10:40,841 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 68 [2022-11-25 18:10:40,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:10:40,849 INFO L225 Difference]: With dead ends: 133 [2022-11-25 18:10:40,849 INFO L226 Difference]: Without dead ends: 84 [2022-11-25 18:10:40,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 126 SyntacticMatches, 8 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=77, Invalid=474, Unknown=1, NotChecked=0, Total=552 [2022-11-25 18:10:40,862 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 54 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:10:40,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 336 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-25 18:10:40,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-25 18:10:40,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2022-11-25 18:10:40,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 57 states have internal predecessors, (69), 22 states have call successors, (22), 5 states have call predecessors, (22), 6 states have return successors, (25), 20 states have call predecessors, (25), 21 states have call successors, (25) [2022-11-25 18:10:40,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 116 transitions. [2022-11-25 18:10:40,903 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 116 transitions. Word has length 68 [2022-11-25 18:10:40,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:10:40,911 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 116 transitions. [2022-11-25 18:10:40,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 18:10:40,912 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 116 transitions. [2022-11-25 18:10:40,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-25 18:10:40,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:10:40,915 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:10:40,929 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 18:10:41,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:41,116 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:10:41,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:10:41,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1895898232, now seen corresponding path program 1 times [2022-11-25 18:10:41,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:10:41,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938736807] [2022-11-25 18:10:41,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:41,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:10:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:41,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:10:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:41,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:10:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:41,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:10:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:41,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:10:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:41,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:10:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:41,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 18:10:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:41,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-25 18:10:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:41,616 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-25 18:10:41,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:10:41,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938736807] [2022-11-25 18:10:41,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938736807] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:10:41,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471080083] [2022-11-25 18:10:41,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:41,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:41,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:10:41,619 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:10:41,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:10:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:41,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-25 18:10:41,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:10:42,005 INFO L321 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-11-25 18:10:42,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 78 [2022-11-25 18:10:42,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-25 18:10:42,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-11-25 18:10:42,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 26 [2022-11-25 18:10:42,119 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 21 treesize of output 13 [2022-11-25 18:10:42,152 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 13 treesize of output 9 [2022-11-25 18:10:42,999 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:10:42,999 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:10:43,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471080083] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:10:43,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:10:43,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2022-11-25 18:10:43,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610718885] [2022-11-25 18:10:43,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:10:43,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:10:43,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:10:43,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:10:43,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-11-25 18:10:43,011 INFO L87 Difference]: Start difference. First operand 83 states and 116 transitions. Second operand has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-25 18:10:45,056 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-11-25 18:10:47,161 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-11-25 18:10:49,232 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-11-25 18:10:51,322 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-11-25 18:10:53,402 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-11-25 18:10:54,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:10:54,690 INFO L93 Difference]: Finished difference Result 187 states and 255 transitions. [2022-11-25 18:10:54,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 18:10:54,691 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 68 [2022-11-25 18:10:54,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:10:54,693 INFO L225 Difference]: With dead ends: 187 [2022-11-25 18:10:54,693 INFO L226 Difference]: Without dead ends: 123 [2022-11-25 18:10:54,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2022-11-25 18:10:54,696 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 203 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 82 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:10:54,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 537 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 405 Invalid, 5 Unknown, 0 Unchecked, 11.2s Time] [2022-11-25 18:10:54,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-25 18:10:54,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2022-11-25 18:10:54,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 85 states have internal predecessors, (109), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-25 18:10:54,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 155 transitions. [2022-11-25 18:10:54,728 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 155 transitions. Word has length 68 [2022-11-25 18:10:54,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:10:54,729 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 155 transitions. [2022-11-25 18:10:54,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-25 18:10:54,730 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 155 transitions. [2022-11-25 18:10:54,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-25 18:10:54,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:10:54,733 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:10:54,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:10:54,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:54,942 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:10:54,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:10:54,943 INFO L85 PathProgramCache]: Analyzing trace with hash -870125630, now seen corresponding path program 1 times [2022-11-25 18:10:54,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:10:54,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343196892] [2022-11-25 18:10:54,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:54,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:10:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:55,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:10:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:55,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:10:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:55,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:10:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:55,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:10:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:55,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:10:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:55,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 18:10:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:55,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-25 18:10:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-25 18:10:55,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:10:55,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343196892] [2022-11-25 18:10:55,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343196892] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:10:55,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996694821] [2022-11-25 18:10:55,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:55,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:55,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:10:55,443 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:10:55,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:10:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:55,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-25 18:10:55,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:10:55,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-25 18:10:55,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-25 18:10:55,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:55,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:55,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-11-25 18:10:55,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:55,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:10:55,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-11-25 18:10:57,261 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-25 18:10:57,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:10:57,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996694821] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:10:57,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:10:57,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2022-11-25 18:10:57,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847995005] [2022-11-25 18:10:57,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:10:57,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:10:57,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:10:57,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:10:57,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:10:57,266 INFO L87 Difference]: Start difference. First operand 117 states and 155 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 18:10:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:10:58,648 INFO L93 Difference]: Finished difference Result 189 states and 253 transitions. [2022-11-25 18:10:58,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 18:10:58,649 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 68 [2022-11-25 18:10:58,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:10:58,651 INFO L225 Difference]: With dead ends: 189 [2022-11-25 18:10:58,651 INFO L226 Difference]: Without dead ends: 124 [2022-11-25 18:10:58,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 65 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2022-11-25 18:10:58,653 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 101 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:10:58,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 500 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 18:10:58,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-25 18:10:58,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 119. [2022-11-25 18:10:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 87 states have internal predecessors, (111), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-25 18:10:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 157 transitions. [2022-11-25 18:10:58,693 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 157 transitions. Word has length 68 [2022-11-25 18:10:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:10:58,694 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 157 transitions. [2022-11-25 18:10:58,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-25 18:10:58,695 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 157 transitions. [2022-11-25 18:10:58,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-25 18:10:58,702 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:10:58,702 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:10:58,715 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-25 18:10:58,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:58,910 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:10:58,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:10:58,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1349834108, now seen corresponding path program 1 times [2022-11-25 18:10:58,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:10:58,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926492728] [2022-11-25 18:10:58,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:58,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:10:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:59,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:10:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:59,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:10:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:59,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:10:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:59,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:10:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:59,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:10:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:59,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 18:10:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:59,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-25 18:10:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:59,748 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-25 18:10:59,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:10:59,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926492728] [2022-11-25 18:10:59,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926492728] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:10:59,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365870730] [2022-11-25 18:10:59,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:59,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:59,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:10:59,755 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:10:59,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:10:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:59,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-25 18:10:59,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:11:00,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:00,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-25 18:11:00,658 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:11:00,658 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:11:00,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365870730] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:11:00,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:11:00,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2022-11-25 18:11:00,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454218167] [2022-11-25 18:11:00,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:11:00,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:11:00,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:11:00,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:11:00,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-11-25 18:11:00,664 INFO L87 Difference]: Start difference. First operand 119 states and 157 transitions. Second operand has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-25 18:11:01,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:11:01,546 INFO L93 Difference]: Finished difference Result 199 states and 264 transitions. [2022-11-25 18:11:01,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:11:01,547 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 68 [2022-11-25 18:11:01,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:11:01,549 INFO L225 Difference]: With dead ends: 199 [2022-11-25 18:11:01,549 INFO L226 Difference]: Without dead ends: 128 [2022-11-25 18:11:01,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-11-25 18:11:01,551 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 123 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:11:01,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 456 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 18:11:01,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-25 18:11:01,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 121. [2022-11-25 18:11:01,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 89 states have internal predecessors, (113), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-25 18:11:01,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 159 transitions. [2022-11-25 18:11:01,579 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 159 transitions. Word has length 68 [2022-11-25 18:11:01,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:11:01,579 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 159 transitions. [2022-11-25 18:11:01,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-25 18:11:01,580 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 159 transitions. [2022-11-25 18:11:01,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-25 18:11:01,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:11:01,582 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:11:01,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:11:01,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:11:01,803 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:11:01,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:11:01,804 INFO L85 PathProgramCache]: Analyzing trace with hash 132396214, now seen corresponding path program 1 times [2022-11-25 18:11:01,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:11:01,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667931667] [2022-11-25 18:11:01,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:01,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:11:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:01,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:11:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:01,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:11:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:02,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:11:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:02,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:11:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:02,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:11:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:02,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 18:11:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:02,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-25 18:11:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:02,128 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-25 18:11:02,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:11:02,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667931667] [2022-11-25 18:11:02,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667931667] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:11:02,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069598161] [2022-11-25 18:11:02,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:02,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:11:02,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:11:02,131 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:11:02,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 18:11:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:02,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 18:11:02,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:11:02,452 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 18:11:02,453 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:11:02,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069598161] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:11:02,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:11:02,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2022-11-25 18:11:02,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25516405] [2022-11-25 18:11:02,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:11:02,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:11:02,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:11:02,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:11:02,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:11:02,458 INFO L87 Difference]: Start difference. First operand 121 states and 159 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 18:11:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:11:02,632 INFO L93 Difference]: Finished difference Result 254 states and 345 transitions. [2022-11-25 18:11:02,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:11:02,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2022-11-25 18:11:02,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:11:02,635 INFO L225 Difference]: With dead ends: 254 [2022-11-25 18:11:02,635 INFO L226 Difference]: Without dead ends: 151 [2022-11-25 18:11:02,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:11:02,639 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 110 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:11:02,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 213 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:11:02,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-25 18:11:02,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-11-25 18:11:02,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 113 states have (on average 1.336283185840708) internal successors, (151), 117 states have internal predecessors, (151), 26 states have call successors, (26), 9 states have call predecessors, (26), 11 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2022-11-25 18:11:02,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2022-11-25 18:11:02,675 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 205 transitions. Word has length 68 [2022-11-25 18:11:02,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:11:02,676 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 205 transitions. [2022-11-25 18:11:02,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 18:11:02,677 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 205 transitions. [2022-11-25 18:11:02,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-25 18:11:02,679 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:11:02,679 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:11:02,693 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 18:11:02,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-25 18:11:02,888 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:11:02,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:11:02,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1527433734, now seen corresponding path program 1 times [2022-11-25 18:11:02,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:11:02,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639937452] [2022-11-25 18:11:02,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:02,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:11:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:03,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:11:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:03,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:11:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:03,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:11:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:03,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:11:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:03,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 18:11:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:03,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 18:11:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:03,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 18:11:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:03,139 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-25 18:11:03,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:11:03,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639937452] [2022-11-25 18:11:03,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639937452] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:11:03,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238671716] [2022-11-25 18:11:03,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:03,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:11:03,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:11:03,142 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:11:03,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 18:11:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:03,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 18:11:03,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:11:03,468 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 18:11:03,468 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:11:03,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238671716] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:11:03,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:11:03,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2022-11-25 18:11:03,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332189531] [2022-11-25 18:11:03,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:11:03,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:11:03,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:11:03,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:11:03,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:11:03,472 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 18:11:03,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:11:03,771 INFO L93 Difference]: Finished difference Result 302 states and 418 transitions. [2022-11-25 18:11:03,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:11:03,772 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2022-11-25 18:11:03,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:11:03,774 INFO L225 Difference]: With dead ends: 302 [2022-11-25 18:11:03,775 INFO L226 Difference]: Without dead ends: 169 [2022-11-25 18:11:03,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:11:03,777 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 103 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:11:03,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 241 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:11:03,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-25 18:11:03,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 151. [2022-11-25 18:11:03,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 113 states have (on average 1.336283185840708) internal successors, (151), 117 states have internal predecessors, (151), 26 states have call successors, (26), 9 states have call predecessors, (26), 11 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2022-11-25 18:11:03,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2022-11-25 18:11:03,807 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 205 transitions. Word has length 70 [2022-11-25 18:11:03,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:11:03,808 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 205 transitions. [2022-11-25 18:11:03,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 18:11:03,809 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 205 transitions. [2022-11-25 18:11:03,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-25 18:11:03,811 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:11:03,811 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:11:03,825 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 18:11:04,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:11:04,020 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:11:04,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:11:04,020 INFO L85 PathProgramCache]: Analyzing trace with hash 113531660, now seen corresponding path program 1 times [2022-11-25 18:11:04,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:11:04,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005009099] [2022-11-25 18:11:04,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:04,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:11:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:04,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:11:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:04,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:11:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:04,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 18:11:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:04,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 18:11:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:04,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 18:11:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:04,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 18:11:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:04,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 18:11:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:04,353 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-25 18:11:04,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:11:04,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005009099] [2022-11-25 18:11:04,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005009099] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:11:04,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800695298] [2022-11-25 18:11:04,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:04,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:11:04,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:11:04,356 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:11:04,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 18:11:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:04,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-25 18:11:04,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:11:04,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-25 18:11:04,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-25 18:11:04,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:04,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-25 18:11:04,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:04,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 18:11:04,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:04,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-25 18:11:04,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:04,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-25 18:11:04,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:04,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:04,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-11-25 18:11:04,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:04,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:04,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:04,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 41 [2022-11-25 18:11:05,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-11-25 18:11:05,667 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 18:11:05,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:11:06,176 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 16))) (and (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_647 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 16))))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_647))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_650 Int) (v_ArrVal_651 (Array Int Int)) (v_ArrVal_643 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_651) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_643) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_650)) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2022-11-25 18:11:06,232 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:11:06,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 92 [2022-11-25 18:11:06,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-11-25 18:11:06,343 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 16))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_10| Int)) (or (forall ((v_ArrVal_641 Int) (v_ArrVal_650 Int) (v_ArrVal_651 (Array Int Int)) (v_ArrVal_643 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_641)))) (store (store .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_10| v_ArrVal_651) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_10| v_ArrVal_643) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_650))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0)) (not (< |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_10| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_10| Int)) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_subst_1 Int)) (or (not (= (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 16) (select v_arrayElimArr_5 v_subst_1))) (forall ((v_ArrVal_647 Int)) (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| 0)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_10| v_arrayElimArr_5))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_647))) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2) 0)))) (not (< |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_10| |c_#StackHeapBarrier|)))))) is different from false [2022-11-25 18:11:06,376 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:11:06,377 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:11:06,389 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:11:06,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 54 [2022-11-25 18:11:06,406 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:11:06,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 168 [2022-11-25 18:11:06,427 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:11:06,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 170 [2022-11-25 18:11:07,233 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 7 treesize of output 3 [2022-11-25 18:11:07,309 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:11:07,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 128 [2022-11-25 18:11:07,371 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:11:07,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 54 [2022-11-25 18:11:07,377 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:11:07,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:07,382 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 25 treesize of output 21 [2022-11-25 18:11:07,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:11:07,405 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-25 18:11:07,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2022-11-25 18:11:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 1 not checked. [2022-11-25 18:11:07,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800695298] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:11:07,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:11:07,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 21 [2022-11-25 18:11:07,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387477012] [2022-11-25 18:11:07,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:11:07,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-25 18:11:07,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:11:07,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-25 18:11:07,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=292, Unknown=2, NotChecked=70, Total=420 [2022-11-25 18:11:07,488 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand has 21 states, 20 states have (on average 4.15) internal successors, (83), 19 states have internal predecessors, (83), 7 states have call successors, (19), 3 states have call predecessors, (19), 6 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) [2022-11-25 18:11:09,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:11:09,572 INFO L93 Difference]: Finished difference Result 238 states and 329 transitions. [2022-11-25 18:11:09,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:11:09,573 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.15) internal successors, (83), 19 states have internal predecessors, (83), 7 states have call successors, (19), 3 states have call predecessors, (19), 6 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) Word has length 70 [2022-11-25 18:11:09,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:11:09,575 INFO L225 Difference]: With dead ends: 238 [2022-11-25 18:11:09,576 INFO L226 Difference]: Without dead ends: 172 [2022-11-25 18:11:09,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=144, Invalid=792, Unknown=2, NotChecked=118, Total=1056 [2022-11-25 18:11:09,577 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 125 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 290 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:11:09,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1052 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 663 Invalid, 0 Unknown, 290 Unchecked, 1.3s Time] [2022-11-25 18:11:09,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-11-25 18:11:09,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 158. [2022-11-25 18:11:09,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 118 states have (on average 1.3305084745762712) internal successors, (157), 123 states have internal predecessors, (157), 26 states have call successors, (26), 10 states have call predecessors, (26), 13 states have return successors, (31), 24 states have call predecessors, (31), 24 states have call successors, (31) [2022-11-25 18:11:09,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 214 transitions. [2022-11-25 18:11:09,619 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 214 transitions. Word has length 70 [2022-11-25 18:11:09,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:11:09,620 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 214 transitions. [2022-11-25 18:11:09,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.15) internal successors, (83), 19 states have internal predecessors, (83), 7 states have call successors, (19), 3 states have call predecessors, (19), 6 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) [2022-11-25 18:11:09,620 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 214 transitions. [2022-11-25 18:11:09,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-25 18:11:09,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:11:09,622 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:11:09,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 18:11:09,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:11:09,836 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:11:09,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:11:09,836 INFO L85 PathProgramCache]: Analyzing trace with hash -2140174937, now seen corresponding path program 1 times [2022-11-25 18:11:09,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:11:09,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974623529] [2022-11-25 18:11:09,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:09,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:11:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:09,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:11:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:10,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:11:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:10,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:11:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:10,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 18:11:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:10,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-25 18:11:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:10,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:11:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:10,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 18:11:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-25 18:11:10,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:11:10,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974623529] [2022-11-25 18:11:10,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974623529] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:11:10,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654610129] [2022-11-25 18:11:10,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:10,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:11:10,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:11:10,135 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:11:10,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 18:11:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:10,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 18:11:10,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:11:10,492 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 18:11:10,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:11:10,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654610129] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:11:10,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:11:10,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2022-11-25 18:11:10,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432717800] [2022-11-25 18:11:10,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:11:10,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:11:10,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:11:10,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:11:10,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:11:10,495 INFO L87 Difference]: Start difference. First operand 158 states and 214 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 18:11:10,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:11:10,886 INFO L93 Difference]: Finished difference Result 352 states and 496 transitions. [2022-11-25 18:11:10,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:11:10,887 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-11-25 18:11:10,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:11:10,889 INFO L225 Difference]: With dead ends: 352 [2022-11-25 18:11:10,889 INFO L226 Difference]: Without dead ends: 216 [2022-11-25 18:11:10,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:11:10,891 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 143 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:11:10,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 282 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:11:10,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-25 18:11:10,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 160. [2022-11-25 18:11:10,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 120 states have (on average 1.3416666666666666) internal successors, (161), 125 states have internal predecessors, (161), 26 states have call successors, (26), 10 states have call predecessors, (26), 13 states have return successors, (31), 24 states have call predecessors, (31), 24 states have call successors, (31) [2022-11-25 18:11:10,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 218 transitions. [2022-11-25 18:11:10,934 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 218 transitions. Word has length 72 [2022-11-25 18:11:10,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:11:10,935 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 218 transitions. [2022-11-25 18:11:10,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 18:11:10,935 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 218 transitions. [2022-11-25 18:11:10,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-25 18:11:10,937 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:11:10,938 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:11:10,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 18:11:11,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:11:11,146 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:11:11,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:11:11,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1718314473, now seen corresponding path program 1 times [2022-11-25 18:11:11,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:11:11,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811995000] [2022-11-25 18:11:11,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:11,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:11:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:11,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:11:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:11,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:11:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:11,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:11:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:11,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 18:11:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:11,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-25 18:11:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:11,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 18:11:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:11,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 18:11:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-25 18:11:11,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:11:11,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811995000] [2022-11-25 18:11:11,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811995000] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:11:11,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354753847] [2022-11-25 18:11:11,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:11,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:11:11,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:11:11,418 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:11:11,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 18:11:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:11,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 18:11:11,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:11:11,678 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 18:11:11,679 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:11:11,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354753847] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:11:11,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:11:11,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-25 18:11:11,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440984704] [2022-11-25 18:11:11,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:11:11,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:11:11,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:11:11,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:11:11,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:11:11,682 INFO L87 Difference]: Start difference. First operand 160 states and 218 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 18:11:11,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:11:11,738 INFO L93 Difference]: Finished difference Result 326 states and 472 transitions. [2022-11-25 18:11:11,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:11:11,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2022-11-25 18:11:11,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:11:11,742 INFO L225 Difference]: With dead ends: 326 [2022-11-25 18:11:11,742 INFO L226 Difference]: Without dead ends: 188 [2022-11-25 18:11:11,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:11:11,744 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 6 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:11:11,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 160 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:11:11,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-11-25 18:11:11,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 166. [2022-11-25 18:11:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 126 states have (on average 1.3412698412698412) internal successors, (169), 131 states have internal predecessors, (169), 26 states have call successors, (26), 10 states have call predecessors, (26), 13 states have return successors, (31), 24 states have call predecessors, (31), 24 states have call successors, (31) [2022-11-25 18:11:11,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 226 transitions. [2022-11-25 18:11:11,782 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 226 transitions. Word has length 73 [2022-11-25 18:11:11,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:11:11,783 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 226 transitions. [2022-11-25 18:11:11,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 18:11:11,783 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 226 transitions. [2022-11-25 18:11:11,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-25 18:11:11,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:11:11,785 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:11:11,799 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 18:11:11,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 18:11:11,994 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:11:11,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:11:11,994 INFO L85 PathProgramCache]: Analyzing trace with hash -510263495, now seen corresponding path program 1 times [2022-11-25 18:11:11,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:11:11,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922948556] [2022-11-25 18:11:11,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:11,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:11:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:12,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:11:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:12,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:11:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:12,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:11:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:12,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:11:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:12,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 18:11:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:12,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-25 18:11:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:12,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-25 18:11:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:12,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:11:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:12,276 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-25 18:11:12,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:11:12,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922948556] [2022-11-25 18:11:12,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922948556] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:11:12,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110022467] [2022-11-25 18:11:12,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:12,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:11:12,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:11:12,279 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:11:12,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 18:11:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:12,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 18:11:12,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:11:12,654 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 18:11:12,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:11:12,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110022467] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:11:12,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:11:12,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2022-11-25 18:11:12,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640751751] [2022-11-25 18:11:12,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:11:12,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:11:12,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:11:12,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:11:12,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:11:12,658 INFO L87 Difference]: Start difference. First operand 166 states and 226 transitions. Second operand has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 7 states have internal predecessors, (61), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-25 18:11:12,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:11:12,865 INFO L93 Difference]: Finished difference Result 312 states and 423 transitions. [2022-11-25 18:11:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:11:12,866 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 7 states have internal predecessors, (61), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 81 [2022-11-25 18:11:12,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:11:12,868 INFO L225 Difference]: With dead ends: 312 [2022-11-25 18:11:12,868 INFO L226 Difference]: Without dead ends: 133 [2022-11-25 18:11:12,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:11:12,870 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 103 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:11:12,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 331 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:11:12,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-25 18:11:12,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-11-25 18:11:12,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 100 states have internal predecessors, (118), 24 states have call successors, (24), 10 states have call predecessors, (24), 13 states have return successors, (29), 22 states have call predecessors, (29), 22 states have call successors, (29) [2022-11-25 18:11:12,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 171 transitions. [2022-11-25 18:11:12,933 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 171 transitions. Word has length 81 [2022-11-25 18:11:12,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:11:12,934 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 171 transitions. [2022-11-25 18:11:12,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 7 states have internal predecessors, (61), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-25 18:11:12,934 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 171 transitions. [2022-11-25 18:11:12,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-25 18:11:12,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:11:12,936 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:11:12,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 18:11:13,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:11:13,144 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:11:13,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:11:13,145 INFO L85 PathProgramCache]: Analyzing trace with hash -186702901, now seen corresponding path program 1 times [2022-11-25 18:11:13,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:11:13,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587707662] [2022-11-25 18:11:13,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:13,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:11:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:13,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:11:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:13,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:11:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:13,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 18:11:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:13,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:11:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:13,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 18:11:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:13,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-25 18:11:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:13,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-25 18:11:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:13,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-25 18:11:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-25 18:11:13,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:11:13,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587707662] [2022-11-25 18:11:13,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587707662] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:11:13,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321315548] [2022-11-25 18:11:13,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:13,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:11:13,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:11:13,535 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:11:13,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 18:11:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:13,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-25 18:11:13,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:11:13,901 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:11:13,902 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-11-25 18:11:13,923 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:11:13,923 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-11-25 18:11:15,172 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 18:11:15,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:11:16,042 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 18:11:16,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321315548] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:11:16,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:11:16,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 10] total 26 [2022-11-25 18:11:16,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854733718] [2022-11-25 18:11:16,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:11:16,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 18:11:16,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:11:16,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 18:11:16,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2022-11-25 18:11:16,046 INFO L87 Difference]: Start difference. First operand 133 states and 171 transitions. Second operand has 26 states, 25 states have (on average 4.8) internal successors, (120), 23 states have internal predecessors, (120), 10 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22) [2022-11-25 18:11:18,475 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-11-25 18:11:20,498 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-11-25 18:11:22,516 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-11-25 18:11:23,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:11:23,819 INFO L93 Difference]: Finished difference Result 335 states and 426 transitions. [2022-11-25 18:11:23,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-25 18:11:23,820 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.8) internal successors, (120), 23 states have internal predecessors, (120), 10 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22) Word has length 83 [2022-11-25 18:11:23,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:11:23,822 INFO L225 Difference]: With dead ends: 335 [2022-11-25 18:11:23,822 INFO L226 Difference]: Without dead ends: 200 [2022-11-25 18:11:23,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 160 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=301, Invalid=1861, Unknown=0, NotChecked=0, Total=2162 [2022-11-25 18:11:23,824 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 166 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 87 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:11:23,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 985 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 802 Invalid, 3 Unknown, 0 Unchecked, 7.0s Time] [2022-11-25 18:11:23,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-11-25 18:11:23,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 185. [2022-11-25 18:11:23,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 142 states have (on average 1.232394366197183) internal successors, (175), 146 states have internal predecessors, (175), 26 states have call successors, (26), 14 states have call predecessors, (26), 16 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2022-11-25 18:11:23,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 229 transitions. [2022-11-25 18:11:23,857 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 229 transitions. Word has length 83 [2022-11-25 18:11:23,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:11:23,858 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 229 transitions. [2022-11-25 18:11:23,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.8) internal successors, (120), 23 states have internal predecessors, (120), 10 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22) [2022-11-25 18:11:23,858 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 229 transitions. [2022-11-25 18:11:23,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-25 18:11:23,860 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:11:23,860 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:11:23,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 18:11:24,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 18:11:24,068 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:11:24,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:11:24,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1158117580, now seen corresponding path program 1 times [2022-11-25 18:11:24,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:11:24,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711791289] [2022-11-25 18:11:24,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:24,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:11:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:24,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:11:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:24,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:11:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:24,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 18:11:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:24,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:11:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:24,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 18:11:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:24,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 18:11:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:24,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 18:11:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:24,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 18:11:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:24,815 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-25 18:11:24,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:11:24,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711791289] [2022-11-25 18:11:24,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711791289] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:11:24,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107895002] [2022-11-25 18:11:24,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:24,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:11:24,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:11:24,818 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:11:24,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 18:11:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:25,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-25 18:11:25,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:11:25,217 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:11:25,217 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-11-25 18:11:25,234 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:11:25,234 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-11-25 18:11:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-25 18:11:25,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:11:26,079 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-11-25 18:11:26,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107895002] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:11:26,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:11:26,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 8] total 22 [2022-11-25 18:11:26,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915330703] [2022-11-25 18:11:26,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:11:26,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-25 18:11:26,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:11:26,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-25 18:11:26,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2022-11-25 18:11:26,084 INFO L87 Difference]: Start difference. First operand 185 states and 229 transitions. Second operand has 22 states, 22 states have (on average 4.545454545454546) internal successors, (100), 21 states have internal predecessors, (100), 6 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2022-11-25 18:11:28,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:11:28,235 INFO L93 Difference]: Finished difference Result 522 states and 724 transitions. [2022-11-25 18:11:28,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 18:11:28,236 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.545454545454546) internal successors, (100), 21 states have internal predecessors, (100), 6 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) Word has length 85 [2022-11-25 18:11:28,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:11:28,239 INFO L225 Difference]: With dead ends: 522 [2022-11-25 18:11:28,239 INFO L226 Difference]: Without dead ends: 383 [2022-11-25 18:11:28,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=268, Invalid=1454, Unknown=0, NotChecked=0, Total=1722 [2022-11-25 18:11:28,242 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 286 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:11:28,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 993 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-25 18:11:28,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-11-25 18:11:28,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 248. [2022-11-25 18:11:28,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 197 states have (on average 1.2385786802030456) internal successors, (244), 201 states have internal predecessors, (244), 30 states have call successors, (30), 18 states have call predecessors, (30), 20 states have return successors, (36), 28 states have call predecessors, (36), 28 states have call successors, (36) [2022-11-25 18:11:28,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 310 transitions. [2022-11-25 18:11:28,317 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 310 transitions. Word has length 85 [2022-11-25 18:11:28,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:11:28,317 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 310 transitions. [2022-11-25 18:11:28,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.545454545454546) internal successors, (100), 21 states have internal predecessors, (100), 6 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2022-11-25 18:11:28,318 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 310 transitions. [2022-11-25 18:11:28,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-25 18:11:28,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:11:28,320 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:11:28,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-25 18:11:28,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 18:11:28,530 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:11:28,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:11:28,530 INFO L85 PathProgramCache]: Analyzing trace with hash -2056594444, now seen corresponding path program 1 times [2022-11-25 18:11:28,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:11:28,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331732105] [2022-11-25 18:11:28,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:28,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:11:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:28,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:11:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:28,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:11:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:28,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 18:11:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:28,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:11:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:28,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 18:11:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:28,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 18:11:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:28,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 18:11:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:28,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 18:11:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:28,760 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-25 18:11:28,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:11:28,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331732105] [2022-11-25 18:11:28,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331732105] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:11:28,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078665960] [2022-11-25 18:11:28,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:28,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:11:28,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:11:28,764 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:11:28,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 18:11:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 18:11:29,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:11:29,089 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 18:11:29,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:11:29,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078665960] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:11:29,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:11:29,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-11-25 18:11:29,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445670493] [2022-11-25 18:11:29,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:11:29,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:11:29,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:11:29,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:11:29,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:11:29,094 INFO L87 Difference]: Start difference. First operand 248 states and 310 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 18:11:29,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:11:29,166 INFO L93 Difference]: Finished difference Result 357 states and 456 transitions. [2022-11-25 18:11:29,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:11:29,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 85 [2022-11-25 18:11:29,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:11:29,169 INFO L225 Difference]: With dead ends: 357 [2022-11-25 18:11:29,169 INFO L226 Difference]: Without dead ends: 255 [2022-11-25 18:11:29,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 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-11-25 18:11:29,170 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 8 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:11:29,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 241 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:11:29,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-25 18:11:29,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 248. [2022-11-25 18:11:29,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 197 states have (on average 1.2284263959390862) internal successors, (242), 201 states have internal predecessors, (242), 30 states have call successors, (30), 18 states have call predecessors, (30), 20 states have return successors, (36), 28 states have call predecessors, (36), 28 states have call successors, (36) [2022-11-25 18:11:29,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 308 transitions. [2022-11-25 18:11:29,212 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 308 transitions. Word has length 85 [2022-11-25 18:11:29,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:11:29,212 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 308 transitions. [2022-11-25 18:11:29,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 18:11:29,213 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 308 transitions. [2022-11-25 18:11:29,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-25 18:11:29,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:11:29,214 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:11:29,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-25 18:11:29,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-25 18:11:29,426 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:11:29,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:11:29,427 INFO L85 PathProgramCache]: Analyzing trace with hash -95019786, now seen corresponding path program 1 times [2022-11-25 18:11:29,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:11:29,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168910212] [2022-11-25 18:11:29,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:29,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:11:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:11:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:11:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 18:11:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:11:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-25 18:11:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-25 18:11:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 18:11:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-25 18:11:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,616 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-25 18:11:29,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:11:29,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168910212] [2022-11-25 18:11:29,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168910212] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:11:29,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19976146] [2022-11-25 18:11:29,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:29,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:11:29,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:11:29,619 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:11:29,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 18:11:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:29,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 18:11:29,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:11:29,897 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-25 18:11:29,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:11:29,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19976146] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:11:29,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:11:29,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-11-25 18:11:29,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019364946] [2022-11-25 18:11:29,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:11:29,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:11:29,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:11:29,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:11:29,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:11:29,899 INFO L87 Difference]: Start difference. First operand 248 states and 308 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 18:11:29,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:11:29,971 INFO L93 Difference]: Finished difference Result 359 states and 456 transitions. [2022-11-25 18:11:29,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:11:29,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 85 [2022-11-25 18:11:29,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:11:29,973 INFO L225 Difference]: With dead ends: 359 [2022-11-25 18:11:29,974 INFO L226 Difference]: Without dead ends: 239 [2022-11-25 18:11:29,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 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-11-25 18:11:29,977 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 2 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 231 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-11-25 18:11:29,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 231 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:11:29,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-11-25 18:11:30,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 235. [2022-11-25 18:11:30,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 184 states have (on average 1.201086956521739) internal successors, (221), 188 states have internal predecessors, (221), 30 states have call successors, (30), 18 states have call predecessors, (30), 20 states have return successors, (36), 28 states have call predecessors, (36), 28 states have call successors, (36) [2022-11-25 18:11:30,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 287 transitions. [2022-11-25 18:11:30,019 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 287 transitions. Word has length 85 [2022-11-25 18:11:30,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:11:30,020 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 287 transitions. [2022-11-25 18:11:30,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 18:11:30,020 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 287 transitions. [2022-11-25 18:11:30,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-25 18:11:30,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:11:30,023 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:11:30,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-25 18:11:30,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:11:30,230 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:11:30,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:11:30,230 INFO L85 PathProgramCache]: Analyzing trace with hash 868564162, now seen corresponding path program 1 times [2022-11-25 18:11:30,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:11:30,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097545962] [2022-11-25 18:11:30,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:30,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:11:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:30,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:11:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:30,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:11:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:30,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 18:11:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:30,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:11:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:30,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 18:11:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:30,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-25 18:11:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:30,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:11:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:30,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-25 18:11:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:30,579 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-25 18:11:30,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:11:30,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097545962] [2022-11-25 18:11:30,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097545962] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:11:30,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280823774] [2022-11-25 18:11:30,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:30,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:11:30,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:11:30,582 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:11:30,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-25 18:11:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:30,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-25 18:11:30,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:11:30,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-25 18:11:31,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:31,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 18:11:31,093 INFO L321 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2022-11-25 18:11:31,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 94 [2022-11-25 18:11:31,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:31,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2022-11-25 18:11:31,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-11-25 18:11:31,214 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_50| Int)) (let ((.cse0 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_50|))) (let ((.cse1 (select .cse0 0))) (and (= (select v_DerPreprocessor_4 24) (select .cse0 24)) (<= (+ 2 .cse1) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_50|) (= (select |c_#memory_$Pointer$.base| .cse1) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_50| v_DerPreprocessor_4) .cse1 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_50| v_DerPreprocessor_4) .cse1)))))) is different from true [2022-11-25 18:11:32,076 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 18:11:32,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:11:32,624 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1463 Int) (v_ArrVal_1462 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1465) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24) v_ArrVal_1463)) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset|) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|))) is different from false [2022-11-25 18:11:32,649 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:11:32,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2022-11-25 18:11:32,676 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:11:32,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 149 [2022-11-25 18:11:32,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 140 [2022-11-25 18:11:32,695 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 140 treesize of output 138 [2022-11-25 18:11:32,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-25 18:11:32,837 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 24 treesize of output 22 [2022-11-25 18:11:32,853 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:11:32,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 56 [2022-11-25 18:11:33,063 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 25 trivial. 1 not checked. [2022-11-25 18:11:33,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280823774] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:11:33,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:11:33,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 11] total 26 [2022-11-25 18:11:33,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459327820] [2022-11-25 18:11:33,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:11:33,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 18:11:33,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:11:33,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 18:11:33,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=488, Unknown=4, NotChecked=90, Total=650 [2022-11-25 18:11:33,066 INFO L87 Difference]: Start difference. First operand 235 states and 287 transitions. Second operand has 26 states, 25 states have (on average 4.84) internal successors, (121), 25 states have internal predecessors, (121), 9 states have call successors, (24), 3 states have call predecessors, (24), 7 states have return successors, (23), 7 states have call predecessors, (23), 9 states have call successors, (23) [2022-11-25 18:11:36,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:11:36,475 INFO L93 Difference]: Finished difference Result 411 states and 545 transitions. [2022-11-25 18:11:36,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-25 18:11:36,476 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.84) internal successors, (121), 25 states have internal predecessors, (121), 9 states have call successors, (24), 3 states have call predecessors, (24), 7 states have return successors, (23), 7 states have call predecessors, (23), 9 states have call successors, (23) Word has length 86 [2022-11-25 18:11:36,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:11:36,478 INFO L225 Difference]: With dead ends: 411 [2022-11-25 18:11:36,478 INFO L226 Difference]: Without dead ends: 334 [2022-11-25 18:11:36,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=182, Invalid=1300, Unknown=8, NotChecked=150, Total=1640 [2022-11-25 18:11:36,479 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 134 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 1636 mSolverCounterSat, 109 mSolverCounterUnsat, 36 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1636 IncrementalHoareTripleChecker+Invalid, 36 IncrementalHoareTripleChecker+Unknown, 414 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:11:36,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1327 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1636 Invalid, 36 Unknown, 414 Unchecked, 2.4s Time] [2022-11-25 18:11:36,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-11-25 18:11:36,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 294. [2022-11-25 18:11:36,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 229 states have (on average 1.1877729257641922) internal successors, (272), 234 states have internal predecessors, (272), 40 states have call successors, (40), 20 states have call predecessors, (40), 24 states have return successors, (58), 39 states have call predecessors, (58), 38 states have call successors, (58) [2022-11-25 18:11:36,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 370 transitions. [2022-11-25 18:11:36,557 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 370 transitions. Word has length 86 [2022-11-25 18:11:36,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:11:36,557 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 370 transitions. [2022-11-25 18:11:36,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.84) internal successors, (121), 25 states have internal predecessors, (121), 9 states have call successors, (24), 3 states have call predecessors, (24), 7 states have return successors, (23), 7 states have call predecessors, (23), 9 states have call successors, (23) [2022-11-25 18:11:36,558 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 370 transitions. [2022-11-25 18:11:36,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-25 18:11:36,561 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:11:36,562 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:11:36,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-25 18:11:36,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 18:11:36,769 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:11:36,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:11:36,769 INFO L85 PathProgramCache]: Analyzing trace with hash 503738048, now seen corresponding path program 1 times [2022-11-25 18:11:36,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:11:36,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627642039] [2022-11-25 18:11:36,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:36,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:11:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:36,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:11:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:36,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:11:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:36,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:11:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:36,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:11:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:36,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 18:11:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:36,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:11:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:36,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:11:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:36,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-25 18:11:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:37,003 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-25 18:11:37,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:11:37,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627642039] [2022-11-25 18:11:37,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627642039] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:11:37,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398903173] [2022-11-25 18:11:37,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:37,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:11:37,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:11:37,007 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:11:37,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-25 18:11:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:37,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 18:11:37,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:11:37,380 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 18:11:37,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:11:37,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398903173] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:11:37,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:11:37,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2022-11-25 18:11:37,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119838911] [2022-11-25 18:11:37,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:11:37,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:11:37,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:11:37,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:11:37,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:11:37,385 INFO L87 Difference]: Start difference. First operand 294 states and 370 transitions. Second operand has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-25 18:11:37,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:11:37,676 INFO L93 Difference]: Finished difference Result 442 states and 562 transitions. [2022-11-25 18:11:37,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:11:37,677 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 88 [2022-11-25 18:11:37,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:11:37,679 INFO L225 Difference]: With dead ends: 442 [2022-11-25 18:11:37,679 INFO L226 Difference]: Without dead ends: 288 [2022-11-25 18:11:37,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-11-25 18:11:37,681 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 103 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:11:37,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 277 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:11:37,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-11-25 18:11:37,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2022-11-25 18:11:37,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 225 states have (on average 1.1822222222222223) internal successors, (266), 228 states have internal predecessors, (266), 40 states have call successors, (40), 20 states have call predecessors, (40), 22 states have return successors, (52), 39 states have call predecessors, (52), 38 states have call successors, (52) [2022-11-25 18:11:37,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 358 transitions. [2022-11-25 18:11:37,740 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 358 transitions. Word has length 88 [2022-11-25 18:11:37,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:11:37,741 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 358 transitions. [2022-11-25 18:11:37,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-25 18:11:37,741 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 358 transitions. [2022-11-25 18:11:37,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-25 18:11:37,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:11:37,743 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-25 18:11:37,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-25 18:11:37,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 18:11:37,951 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:11:37,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:11:37,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1592259498, now seen corresponding path program 1 times [2022-11-25 18:11:37,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:11:37,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983661930] [2022-11-25 18:11:37,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:37,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:11:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:38,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:11:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:38,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:11:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:38,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 18:11:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:38,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:11:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:38,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:11:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:38,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-25 18:11:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:38,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-25 18:11:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:38,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:11:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:38,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-25 18:11:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:38,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 18:11:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:38,395 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-11-25 18:11:38,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:11:38,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983661930] [2022-11-25 18:11:38,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983661930] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:11:38,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482236377] [2022-11-25 18:11:38,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:38,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:11:38,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:11:38,398 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:11:38,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-25 18:11:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:38,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 120 conjunts are in the unsatisfiable core [2022-11-25 18:11:38,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:11:38,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-25 18:11:38,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:38,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 18:11:38,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-25 18:11:38,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:38,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 18:11:39,081 INFO L321 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2022-11-25 18:11:39,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 135 [2022-11-25 18:11:39,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:39,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 101 [2022-11-25 18:11:39,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:39,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:39,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:39,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 33 [2022-11-25 18:11:39,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-11-25 18:11:40,846 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 54 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-25 18:11:40,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:11:41,610 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-11-25 18:11:41,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482236377] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:11:41,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:11:41,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 6] total 24 [2022-11-25 18:11:41,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665397903] [2022-11-25 18:11:41,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:11:41,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-25 18:11:41,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:11:41,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-25 18:11:41,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=494, Unknown=1, NotChecked=0, Total=552 [2022-11-25 18:11:41,614 INFO L87 Difference]: Start difference. First operand 288 states and 358 transitions. Second operand has 24 states, 23 states have (on average 5.260869565217392) internal successors, (121), 21 states have internal predecessors, (121), 8 states have call successors, (21), 3 states have call predecessors, (21), 7 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2022-11-25 18:11:45,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:11:45,857 INFO L93 Difference]: Finished difference Result 568 states and 755 transitions. [2022-11-25 18:11:45,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-25 18:11:45,858 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.260869565217392) internal successors, (121), 21 states have internal predecessors, (121), 8 states have call successors, (21), 3 states have call predecessors, (21), 7 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) Word has length 109 [2022-11-25 18:11:45,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:11:45,860 INFO L225 Difference]: With dead ends: 568 [2022-11-25 18:11:45,861 INFO L226 Difference]: Without dead ends: 388 [2022-11-25 18:11:45,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=202, Invalid=1775, Unknown=3, NotChecked=0, Total=1980 [2022-11-25 18:11:45,863 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 67 mSDsluCounter, 2111 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 53 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 2274 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:11:45,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 2274 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1613 Invalid, 20 Unknown, 0 Unchecked, 3.1s Time] [2022-11-25 18:11:45,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-11-25 18:11:45,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 307. [2022-11-25 18:11:45,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 237 states have (on average 1.1561181434599157) internal successors, (274), 249 states have internal predecessors, (274), 41 states have call successors, (41), 21 states have call predecessors, (41), 28 states have return successors, (58), 36 states have call predecessors, (58), 39 states have call successors, (58) [2022-11-25 18:11:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 373 transitions. [2022-11-25 18:11:45,960 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 373 transitions. Word has length 109 [2022-11-25 18:11:45,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:11:45,960 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 373 transitions. [2022-11-25 18:11:45,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.260869565217392) internal successors, (121), 21 states have internal predecessors, (121), 8 states have call successors, (21), 3 states have call predecessors, (21), 7 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2022-11-25 18:11:45,961 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 373 transitions. [2022-11-25 18:11:45,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-25 18:11:45,963 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:11:45,963 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-25 18:11:45,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-25 18:11:46,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-25 18:11:46,179 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:11:46,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:11:46,179 INFO L85 PathProgramCache]: Analyzing trace with hash -104570939, now seen corresponding path program 1 times [2022-11-25 18:11:46,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:11:46,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402855101] [2022-11-25 18:11:46,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:46,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:11:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:46,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:11:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:46,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:11:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:46,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:11:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:46,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:11:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:46,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-25 18:11:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:46,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-25 18:11:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:46,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:11:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:46,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-25 18:11:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:46,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-25 18:11:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:46,587 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-25 18:11:46,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:11:46,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402855101] [2022-11-25 18:11:46,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402855101] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:11:46,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761065508] [2022-11-25 18:11:46,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:46,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:11:46,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:11:46,590 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:11:46,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-25 18:11:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:46,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-25 18:11:46,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:11:47,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-25 18:11:47,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:47,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 18:11:47,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:47,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 18:11:47,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:47,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:47,182 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:11:47,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-11-25 18:11:47,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:47,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:11:47,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2022-11-25 18:11:48,104 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 45 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 18:11:48,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:11:48,657 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:11:48,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 51 [2022-11-25 18:11:48,794 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:11:48,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-11-25 18:11:48,805 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:11:48,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2022-11-25 18:11:48,839 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:11:48,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1169 treesize of output 1169 [2022-11-25 18:11:48,877 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:11:48,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1387 treesize of output 1333 [2022-11-25 18:11:48,962 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:11:48,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1445 treesize of output 1421 [2022-11-25 18:11:49,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-25 18:11:49,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-11-25 18:11:49,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-11-25 18:11:49,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:11:49,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2022-11-25 18:11:49,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2022-11-25 18:11:49,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 61 [2022-11-25 18:11:49,850 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:11:49,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 87 [2022-11-25 18:11:50,154 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-25 18:11:50,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761065508] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:11:50,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:11:50,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 12] total 28 [2022-11-25 18:11:50,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057515998] [2022-11-25 18:11:50,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:11:50,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-25 18:11:50,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:11:50,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 18:11:50,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=666, Unknown=3, NotChecked=0, Total=756 [2022-11-25 18:11:50,158 INFO L87 Difference]: Start difference. First operand 307 states and 373 transitions. Second operand has 28 states, 27 states have (on average 5.185185185185185) internal successors, (140), 27 states have internal predecessors, (140), 9 states have call successors, (25), 3 states have call predecessors, (25), 7 states have return successors, (24), 7 states have call predecessors, (24), 9 states have call successors, (24) [2022-11-25 18:11:53,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:11:53,327 INFO L93 Difference]: Finished difference Result 493 states and 636 transitions. [2022-11-25 18:11:53,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-25 18:11:53,328 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 5.185185185185185) internal successors, (140), 27 states have internal predecessors, (140), 9 states have call successors, (25), 3 states have call predecessors, (25), 7 states have return successors, (24), 7 states have call predecessors, (24), 9 states have call successors, (24) Word has length 101 [2022-11-25 18:11:53,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:11:53,331 INFO L225 Difference]: With dead ends: 493 [2022-11-25 18:11:53,331 INFO L226 Difference]: Without dead ends: 345 [2022-11-25 18:11:53,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=390, Invalid=2469, Unknown=3, NotChecked=0, Total=2862 [2022-11-25 18:11:53,333 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 186 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:11:53,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1193 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-25 18:11:53,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-11-25 18:11:53,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 294. [2022-11-25 18:11:53,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 232 states have (on average 1.1551724137931034) internal successors, (268), 244 states have internal predecessors, (268), 33 states have call successors, (33), 21 states have call predecessors, (33), 28 states have return successors, (46), 28 states have call predecessors, (46), 31 states have call successors, (46) [2022-11-25 18:11:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 347 transitions. [2022-11-25 18:11:53,402 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 347 transitions. Word has length 101 [2022-11-25 18:11:53,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:11:53,402 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 347 transitions. [2022-11-25 18:11:53,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 5.185185185185185) internal successors, (140), 27 states have internal predecessors, (140), 9 states have call successors, (25), 3 states have call predecessors, (25), 7 states have return successors, (24), 7 states have call predecessors, (24), 9 states have call successors, (24) [2022-11-25 18:11:53,403 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 347 transitions. [2022-11-25 18:11:53,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-25 18:11:53,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:11:53,405 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:11:53,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-25 18:11:53,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:11:53,614 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:11:53,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:11:53,614 INFO L85 PathProgramCache]: Analyzing trace with hash -2065682137, now seen corresponding path program 1 times [2022-11-25 18:11:53,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:11:53,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916013050] [2022-11-25 18:11:53,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:53,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:11:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:55,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:11:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:55,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:11:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:55,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:11:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:55,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:11:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:55,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 18:11:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:55,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:11:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:56,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:11:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:56,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 18:11:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:56,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 18:11:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:57,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:11:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:57,473 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-25 18:11:57,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:11:57,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916013050] [2022-11-25 18:11:57,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916013050] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:11:57,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780914979] [2022-11-25 18:11:57,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:11:57,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:11:57,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:11:57,475 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:11:57,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-25 18:11:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:11:57,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 131 conjunts are in the unsatisfiable core [2022-11-25 18:11:57,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:11:57,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-25 18:11:57,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:11:57,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-25 18:11:57,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:12:02,562 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 54 proven. 40 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 18:12:02,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:12:14,558 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-11-25 18:12:24,777 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-11-25 18:12:26,599 INFO L321 Elim1Store]: treesize reduction 23, result has 86.1 percent of original size [2022-11-25 18:12:26,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 2894 treesize of output 2849 [2022-11-25 18:12:27,081 INFO L321 Elim1Store]: treesize reduction 23, result has 89.1 percent of original size [2022-11-25 18:12:27,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 33818 treesize of output 31345 [2022-11-25 18:12:27,597 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:12:27,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 36921 treesize of output 35659 [2022-11-25 18:12:29,437 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:12:29,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 41934 treesize of output 40064 [2022-11-25 18:12:30,489 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:12:30,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 39640 treesize of output 38063 [2022-11-25 18:12:32,014 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:12:32,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 37506 treesize of output 37019 [2022-11-25 18:13:25,336 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-25 18:13:25,955 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:13:25,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 64 [2022-11-25 18:13:26,235 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:13:26,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 184 [2022-11-25 18:13:26,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-25 18:13:26,468 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:13:26,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-25 18:13:26,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:13:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 33 proven. 46 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-25 18:13:26,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780914979] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:13:26,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:13:26,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 28, 25] total 67 [2022-11-25 18:13:26,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283119466] [2022-11-25 18:13:26,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:13:26,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-25 18:13:26,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:13:26,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-25 18:13:26,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=4130, Unknown=0, NotChecked=0, Total=4422 [2022-11-25 18:13:26,744 INFO L87 Difference]: Start difference. First operand 294 states and 347 transitions. Second operand has 67 states, 64 states have (on average 3.1875) internal successors, (204), 58 states have internal predecessors, (204), 20 states have call successors, (26), 4 states have call predecessors, (26), 15 states have return successors, (26), 19 states have call predecessors, (26), 19 states have call successors, (26) [2022-11-25 18:13:28,876 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-11-25 18:13:30,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 18:13:38,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:13:38,817 INFO L93 Difference]: Finished difference Result 468 states and 570 transitions. [2022-11-25 18:13:38,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-11-25 18:13:38,818 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 64 states have (on average 3.1875) internal successors, (204), 58 states have internal predecessors, (204), 20 states have call successors, (26), 4 states have call predecessors, (26), 15 states have return successors, (26), 19 states have call predecessors, (26), 19 states have call successors, (26) Word has length 113 [2022-11-25 18:13:38,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:13:38,819 INFO L225 Difference]: With dead ends: 468 [2022-11-25 18:13:38,819 INFO L226 Difference]: Without dead ends: 344 [2022-11-25 18:13:38,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 206 SyntacticMatches, 7 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2486 ImplicationChecksByTransitivity, 29.5s TimeCoverageRelationStatistics Valid=955, Invalid=9347, Unknown=0, NotChecked=0, Total=10302 [2022-11-25 18:13:38,824 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 554 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 2771 mSolverCounterSat, 291 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 3064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 2771 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:13:38,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1669 Invalid, 3064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 2771 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2022-11-25 18:13:38,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-11-25 18:13:38,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 296. [2022-11-25 18:13:38,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 234 states have (on average 1.1538461538461537) internal successors, (270), 244 states have internal predecessors, (270), 33 states have call successors, (33), 21 states have call predecessors, (33), 28 states have return successors, (46), 30 states have call predecessors, (46), 31 states have call successors, (46) [2022-11-25 18:13:38,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 349 transitions. [2022-11-25 18:13:38,911 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 349 transitions. Word has length 113 [2022-11-25 18:13:38,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:13:38,911 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 349 transitions. [2022-11-25 18:13:38,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 64 states have (on average 3.1875) internal successors, (204), 58 states have internal predecessors, (204), 20 states have call successors, (26), 4 states have call predecessors, (26), 15 states have return successors, (26), 19 states have call predecessors, (26), 19 states have call successors, (26) [2022-11-25 18:13:38,912 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 349 transitions. [2022-11-25 18:13:38,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-25 18:13:38,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:13:38,913 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:13:38,927 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-11-25 18:13:39,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:13:39,121 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:13:39,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:13:39,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1476333347, now seen corresponding path program 1 times [2022-11-25 18:13:39,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:13:39,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663608614] [2022-11-25 18:13:39,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:13:39,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:13:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:39,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:13:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:39,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:13:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:39,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:13:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:39,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:13:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:39,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 18:13:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:39,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:13:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:39,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:13:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:39,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 18:13:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:39,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 18:13:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:39,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:13:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:39,632 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-25 18:13:39,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:13:39,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663608614] [2022-11-25 18:13:39,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663608614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:13:39,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:13:39,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:13:39,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075876631] [2022-11-25 18:13:39,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:13:39,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:13:39,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:13:39,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:13:39,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:13:39,636 INFO L87 Difference]: Start difference. First operand 296 states and 349 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-25 18:13:39,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:13:39,878 INFO L93 Difference]: Finished difference Result 540 states and 655 transitions. [2022-11-25 18:13:39,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:13:39,879 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 113 [2022-11-25 18:13:39,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:13:39,881 INFO L225 Difference]: With dead ends: 540 [2022-11-25 18:13:39,881 INFO L226 Difference]: Without dead ends: 275 [2022-11-25 18:13:39,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:13:39,884 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 58 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:13:39,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 450 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:13:39,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-25 18:13:39,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2022-11-25 18:13:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 215 states have (on average 1.0930232558139534) internal successors, (235), 222 states have internal predecessors, (235), 33 states have call successors, (33), 21 states have call predecessors, (33), 24 states have return successors, (42), 29 states have call predecessors, (42), 31 states have call successors, (42) [2022-11-25 18:13:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 310 transitions. [2022-11-25 18:13:39,950 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 310 transitions. Word has length 113 [2022-11-25 18:13:39,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:13:39,951 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 310 transitions. [2022-11-25 18:13:39,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-25 18:13:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 310 transitions. [2022-11-25 18:13:39,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-25 18:13:39,953 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:13:39,953 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:13:39,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 18:13:39,954 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:13:39,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:13:39,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1112769404, now seen corresponding path program 1 times [2022-11-25 18:13:39,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:13:39,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544221538] [2022-11-25 18:13:39,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:13:39,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:13:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:40,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:13:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:40,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:13:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:40,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:13:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:40,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:13:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:40,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 18:13:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:40,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:13:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:40,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:13:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:40,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 18:13:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:40,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 18:13:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:40,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:13:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:40,311 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-11-25 18:13:40,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:13:40,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544221538] [2022-11-25 18:13:40,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544221538] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:13:40,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:13:40,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:13:40,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658942414] [2022-11-25 18:13:40,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:13:40,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:13:40,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:13:40,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:13:40,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:13:40,315 INFO L87 Difference]: Start difference. First operand 273 states and 310 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-11-25 18:13:40,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:13:40,482 INFO L93 Difference]: Finished difference Result 287 states and 325 transitions. [2022-11-25 18:13:40,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:13:40,483 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 116 [2022-11-25 18:13:40,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:13:40,485 INFO L225 Difference]: With dead ends: 287 [2022-11-25 18:13:40,485 INFO L226 Difference]: Without dead ends: 285 [2022-11-25 18:13:40,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:13:40,488 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 10 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:13:40,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 537 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:13:40,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-11-25 18:13:40,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2022-11-25 18:13:40,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 221 states have (on average 1.090497737556561) internal successors, (241), 228 states have internal predecessors, (241), 35 states have call successors, (35), 23 states have call predecessors, (35), 26 states have return successors, (44), 31 states have call predecessors, (44), 33 states have call successors, (44) [2022-11-25 18:13:40,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 320 transitions. [2022-11-25 18:13:40,556 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 320 transitions. Word has length 116 [2022-11-25 18:13:40,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:13:40,556 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 320 transitions. [2022-11-25 18:13:40,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-11-25 18:13:40,557 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 320 transitions. [2022-11-25 18:13:40,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-25 18:13:40,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:13:40,558 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:13:40,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 18:13:40,558 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:13:40,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:13:40,559 INFO L85 PathProgramCache]: Analyzing trace with hash 594113950, now seen corresponding path program 2 times [2022-11-25 18:13:40,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:13:40,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61590640] [2022-11-25 18:13:40,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:13:40,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:13:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:42,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:13:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:42,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:13:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:42,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:13:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:42,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:13:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:42,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 18:13:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:42,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:13:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:42,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:13:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:42,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 18:13:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:42,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 18:13:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:42,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:13:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:42,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:13:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:13:43,088 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 42 proven. 46 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-25 18:13:43,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:13:43,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61590640] [2022-11-25 18:13:43,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61590640] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:13:43,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750003130] [2022-11-25 18:13:43,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:13:43,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:13:43,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:13:43,090 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:13:43,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-25 18:13:43,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:13:43,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:13:43,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-25 18:13:43,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:13:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 100 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 18:13:47,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:14:04,763 WARN L233 SmtUtils]: Spent 14.02s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:14:18,972 WARN L233 SmtUtils]: Spent 14.02s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:14:33,152 WARN L233 SmtUtils]: Spent 14.03s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:14:47,318 WARN L233 SmtUtils]: Spent 14.03s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:14:48,248 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:14:48,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 1 [2022-11-25 18:14:48,609 INFO L321 Elim1Store]: treesize reduction 4, result has 94.4 percent of original size [2022-11-25 18:14:48,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 95 [2022-11-25 18:14:48,685 INFO L321 Elim1Store]: treesize reduction 13, result has 78.3 percent of original size [2022-11-25 18:14:48,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 99 [2022-11-25 18:14:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-25 18:14:49,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750003130] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:14:49,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:14:49,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 18] total 55 [2022-11-25 18:14:49,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846293774] [2022-11-25 18:14:49,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:14:49,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-25 18:14:49,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:14:49,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-25 18:14:49,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2761, Unknown=1, NotChecked=0, Total=2970 [2022-11-25 18:14:49,763 INFO L87 Difference]: Start difference. First operand 283 states and 320 transitions. Second operand has 55 states, 54 states have (on average 3.240740740740741) internal successors, (175), 54 states have internal predecessors, (175), 19 states have call successors, (32), 4 states have call predecessors, (32), 12 states have return successors, (31), 17 states have call predecessors, (31), 18 states have call successors, (31) [2022-11-25 18:15:18,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:18,899 INFO L93 Difference]: Finished difference Result 784 states and 963 transitions. [2022-11-25 18:15:18,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-25 18:15:18,900 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 3.240740740740741) internal successors, (175), 54 states have internal predecessors, (175), 19 states have call successors, (32), 4 states have call predecessors, (32), 12 states have return successors, (31), 17 states have call predecessors, (31), 18 states have call successors, (31) Word has length 124 [2022-11-25 18:15:18,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:18,903 INFO L225 Difference]: With dead ends: 784 [2022-11-25 18:15:18,903 INFO L226 Difference]: Without dead ends: 648 [2022-11-25 18:15:18,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 250 SyntacticMatches, 4 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2529 ImplicationChecksByTransitivity, 85.9s TimeCoverageRelationStatistics Valid=1237, Invalid=9892, Unknown=1, NotChecked=0, Total=11130 [2022-11-25 18:15:18,908 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 579 mSDsluCounter, 2136 mSDsCounter, 0 mSdLazyCounter, 4252 mSolverCounterSat, 472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 2248 SdHoareTripleChecker+Invalid, 4724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 472 IncrementalHoareTripleChecker+Valid, 4252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:18,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 2248 Invalid, 4724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [472 Valid, 4252 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-11-25 18:15:18,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2022-11-25 18:15:19,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 529. [2022-11-25 18:15:19,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 409 states have (on average 1.1002444987775062) internal successors, (450), 423 states have internal predecessors, (450), 72 states have call successors, (72), 38 states have call predecessors, (72), 47 states have return successors, (96), 67 states have call predecessors, (96), 68 states have call successors, (96) [2022-11-25 18:15:19,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 618 transitions. [2022-11-25 18:15:19,067 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 618 transitions. Word has length 124 [2022-11-25 18:15:19,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:19,068 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 618 transitions. [2022-11-25 18:15:19,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 3.240740740740741) internal successors, (175), 54 states have internal predecessors, (175), 19 states have call successors, (32), 4 states have call predecessors, (32), 12 states have return successors, (31), 17 states have call predecessors, (31), 18 states have call successors, (31) [2022-11-25 18:15:19,069 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 618 transitions. [2022-11-25 18:15:19,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-25 18:15:19,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:19,070 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-25 18:15:19,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-25 18:15:19,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-25 18:15:19,282 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:15:19,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:19,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1242461055, now seen corresponding path program 2 times [2022-11-25 18:15:19,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:19,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178778217] [2022-11-25 18:15:19,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:19,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:20,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:15:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:20,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:15:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:20,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 18:15:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:20,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:15:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:20,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:15:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:20,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 18:15:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:20,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 18:15:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:20,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:15:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:20,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-25 18:15:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:20,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-25 18:15:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:20,375 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 29 proven. 13 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-11-25 18:15:20,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:20,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178778217] [2022-11-25 18:15:20,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178778217] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:15:20,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997070181] [2022-11-25 18:15:20,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:15:20,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:15:20,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:15:20,378 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:15:20,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-25 18:15:20,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:15:20,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:15:20,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-25 18:15:20,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:15:20,892 INFO L321 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-11-25 18:15:20,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 78 [2022-11-25 18:15:20,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-25 18:15:20,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-11-25 18:15:20,957 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-11-25 18:15:20,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 36 [2022-11-25 18:15:20,961 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 29 treesize of output 17 [2022-11-25 18:15:21,117 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78| Int)) (and (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78|) 24) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78|) (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78|) 24))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= .cse0 (select v_DerPreprocessor_10 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78| v_DerPreprocessor_10) .cse0 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78| v_DerPreprocessor_10) .cse0) (select |c_#memory_$Pointer$.base| .cse0)))) (not (= .cse0 0)))))) is different from true [2022-11-25 18:15:21,746 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 0) (let ((.cse1 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse1))) (or (and (= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| .cse0) (not (= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| 0))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= .cse0 (select v_DerPreprocessor_10 .cse1)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_9) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| v_DerPreprocessor_10) .cse0 v_DerPreprocessor_9) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| v_DerPreprocessor_10) .cse0)))) (not (= .cse0 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78| Int)) (and (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78|) 24) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78|) (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78|) 24))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= .cse2 (select v_DerPreprocessor_10 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78| v_DerPreprocessor_10) .cse2 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78| v_DerPreprocessor_10) .cse2) (select |c_#memory_$Pointer$.base| .cse2)))) (not (= .cse2 0))))))) is different from true [2022-11-25 18:15:21,788 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_79| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_79|) 24))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_DerPreprocessor_10 24) .cse0) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_79| v_DerPreprocessor_10) .cse0 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_79| v_DerPreprocessor_10) .cse0) (select |c_#memory_$Pointer$.base| .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_79| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_79| 0)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_79|) 24) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_79|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78| Int)) (and (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78|) 24) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78|) (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78|) 24))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= .cse1 (select v_DerPreprocessor_10 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78| v_DerPreprocessor_10) .cse1 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78| v_DerPreprocessor_10) .cse1) (select |c_#memory_$Pointer$.base| .cse1)))) (not (= .cse1 0))))))) is different from true [2022-11-25 18:15:21,963 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_79| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_79|) 24))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_DerPreprocessor_10 24) .cse0) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_79| v_DerPreprocessor_10) .cse0 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_79| v_DerPreprocessor_10) .cse0) (select |c_#memory_$Pointer$.base| .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_79| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_79| 0)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_79|) 24) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_79|)))) (= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 0) (let ((.cse2 (+ |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.offset| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base|) .cse2))) (or (and (= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| .cse1) (not (= |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| 0))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= .cse1 (select v_DerPreprocessor_10 .cse2)) (= (select |c_#memory_$Pointer$.base| .cse1) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_9) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| v_DerPreprocessor_10) .cse1 v_DerPreprocessor_9) |c_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base| v_DerPreprocessor_10) .cse1)))) (not (= .cse1 0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78| Int)) (and (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78|) 24) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78|) (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78|) 24))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= .cse3 (select v_DerPreprocessor_10 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78| v_DerPreprocessor_10) .cse3 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78| v_DerPreprocessor_10) .cse3) (select |c_#memory_$Pointer$.base| .cse3)))) (not (= .cse3 0))))))) is different from true [2022-11-25 18:15:28,689 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_33| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_33|) 24))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_10) .cse0 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_33| v_DerPreprocessor_10) .cse0)) (= (select v_DerPreprocessor_10 24) .cse0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_33| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_33| 0)) (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_33| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_33|) 24))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_35| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_35| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_35|) 24)) (not (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_35| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_35| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_35|) 24))) (and (not (= .cse1 0)) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_35| v_DerPreprocessor_10) .cse1 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_35| v_DerPreprocessor_10) .cse1) (select |c_#memory_$Pointer$.base| .cse1)) (= (select v_DerPreprocessor_10 24) .cse1))))))) (or |c_aws_linked_list_is_valid_#t~short303#1| (= (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)) 0)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_79| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_79|) 24))) (and (not (= .cse2 0)) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select v_DerPreprocessor_10 24) .cse2) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_79| v_DerPreprocessor_10) .cse2 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_79| v_DerPreprocessor_10) .cse2) (select |c_#memory_$Pointer$.base| .cse2))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_79| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_79| 0)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_79|) 24) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_79|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_34| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_34|) 24))) (and (not (= .cse3 0)) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_34| v_DerPreprocessor_10) .cse3 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_34| v_DerPreprocessor_10) .cse3) (select |c_#memory_$Pointer$.base| .cse3)) (= .cse3 (select v_DerPreprocessor_10 24))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_34| Int)) (and (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_34|) 24) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_34|) (not (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_34| 0))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78| Int)) (and (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78|) 24) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78|) (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78|) 24))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (and (= .cse4 (select v_DerPreprocessor_10 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78| v_DerPreprocessor_10) .cse4 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_78| v_DerPreprocessor_10) .cse4) (select |c_#memory_$Pointer$.base| .cse4)))) (not (= .cse4 0))))))) is different from true [2022-11-25 18:15:29,648 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 60 not checked. [2022-11-25 18:15:29,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:15:30,183 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:15:30,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 127 [2022-11-25 18:15:30,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 128 [2022-11-25 18:15:30,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 124 [2022-11-25 18:15:30,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-25 18:15:30,258 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 22 treesize of output 18 [2022-11-25 18:15:30,459 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-25 18:15:30,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997070181] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 18:15:30,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:15:30,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12, 19] total 37 [2022-11-25 18:15:30,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605352441] [2022-11-25 18:15:30,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:15:30,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:15:30,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:15:30,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:15:30,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=836, Unknown=63, NotChecked=320, Total=1332 [2022-11-25 18:15:30,461 INFO L87 Difference]: Start difference. First operand 529 states and 618 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-25 18:15:31,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:15:31,053 INFO L93 Difference]: Finished difference Result 657 states and 766 transitions. [2022-11-25 18:15:31,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:15:31,053 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 113 [2022-11-25 18:15:31,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:15:31,056 INFO L225 Difference]: With dead ends: 657 [2022-11-25 18:15:31,056 INFO L226 Difference]: Without dead ends: 529 [2022-11-25 18:15:31,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=139, Invalid=1078, Unknown=63, NotChecked=360, Total=1640 [2022-11-25 18:15:31,058 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 47 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:15:31,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 351 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:15:31,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-11-25 18:15:31,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2022-11-25 18:15:31,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 409 states have (on average 1.0929095354523228) internal successors, (447), 423 states have internal predecessors, (447), 72 states have call successors, (72), 38 states have call predecessors, (72), 47 states have return successors, (96), 67 states have call predecessors, (96), 68 states have call successors, (96) [2022-11-25 18:15:31,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 615 transitions. [2022-11-25 18:15:31,224 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 615 transitions. Word has length 113 [2022-11-25 18:15:31,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:15:31,225 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 615 transitions. [2022-11-25 18:15:31,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-25 18:15:31,225 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 615 transitions. [2022-11-25 18:15:31,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-25 18:15:31,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:15:31,227 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:15:31,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-25 18:15:31,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-25 18:15:31,434 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:15:31,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:15:31,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1635488065, now seen corresponding path program 1 times [2022-11-25 18:15:31,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:15:31,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131392697] [2022-11-25 18:15:31,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:31,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:15:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:32,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:15:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:32,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:15:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:32,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 18:15:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:32,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:15:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:32,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:15:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:32,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 18:15:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:32,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 18:15:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:32,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:15:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:32,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-25 18:15:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:32,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-25 18:15:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:32,783 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 29 proven. 13 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-11-25 18:15:32,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:15:32,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131392697] [2022-11-25 18:15:32,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131392697] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:15:32,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644082097] [2022-11-25 18:15:32,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:15:32,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:15:32,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:15:32,786 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:15:32,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-25 18:15:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:15:33,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-25 18:15:33,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:15:33,234 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:15:33,234 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-11-25 18:15:33,252 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:15:33,253 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-11-25 18:15:35,499 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21|) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21|))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21|) (+ 16 |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21|))))) is different from true [2022-11-25 18:15:37,661 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_86| Int)) (not (= |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_86| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_86|) 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_86| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_86|) 0) 16)))) is different from true [2022-11-25 18:15:39,795 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_39| Int)) (not (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_39| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_39|) 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_39| Int)) (not (= 16 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_39|) 0))))) is different from true [2022-11-25 18:15:49,894 WARN L233 SmtUtils]: Spent 8.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-11-25 18:16:04,047 WARN L233 SmtUtils]: Spent 8.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-11-25 18:16:14,150 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:16:24,349 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:16:32,482 WARN L233 SmtUtils]: Spent 8.02s 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-11-25 18:16:32,521 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 64 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2022-11-25 18:16:32,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:16:35,659 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 6 proven. 53 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-25 18:16:35,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644082097] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:16:35,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:16:35,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19, 14] total 39 [2022-11-25 18:16:35,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797352045] [2022-11-25 18:16:35,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:16:35,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-25 18:16:35,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:16:35,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-25 18:16:35,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1108, Unknown=10, NotChecked=210, Total=1482 [2022-11-25 18:16:35,662 INFO L87 Difference]: Start difference. First operand 529 states and 615 transitions. Second operand has 39 states, 36 states have (on average 4.805555555555555) internal successors, (173), 37 states have internal predecessors, (173), 17 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 13 states have call predecessors, (27), 17 states have call successors, (27) [2022-11-25 18:16:37,980 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-11-25 18:16:39,998 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-11-25 18:16:42,018 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-11-25 18:16:44,031 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-11-25 18:16:48,088 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-11-25 18:16:50,103 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-11-25 18:16:52,110 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-11-25 18:16:54,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:16:56,135 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-11-25 18:16:58,151 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-11-25 18:17:00,158 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-11-25 18:17:02,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:17:04,178 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-11-25 18:17:06,194 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-11-25 18:17:08,213 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-11-25 18:17:10,223 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-11-25 18:17:16,260 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-11-25 18:17:18,268 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-11-25 18:17:20,274 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-11-25 18:17:22,280 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-11-25 18:17:30,327 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-11-25 18:17:32,336 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-11-25 18:17:34,344 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-11-25 18:17:36,347 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-11-25 18:17:38,364 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-11-25 18:17:44,413 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-11-25 18:17:46,421 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-11-25 18:17:48,425 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-11-25 18:17:50,434 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-11-25 18:17:52,440 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-11-25 18:17:54,444 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-11-25 18:18:02,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:18:04,526 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-11-25 18:18:06,531 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-11-25 18:18:08,539 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-11-25 18:18:10,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:18:12,604 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-11-25 18:18:14,610 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-11-25 18:18:16,628 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-11-25 18:18:18,631 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-11-25 18:18:20,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:18:28,703 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-11-25 18:18:30,706 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-11-25 18:18:32,710 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-11-25 18:18:38,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:18:40,779 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-11-25 18:18:42,782 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-11-25 18:18:44,786 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-11-25 18:18:54,844 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-11-25 18:18:56,848 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-11-25 18:18:58,853 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-11-25 18:19:06,926 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-11-25 18:19:08,931 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-11-25 18:19:14,981 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-11-25 18:19:16,985 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-11-25 18:19:18,988 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-11-25 18:19:20,990 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-11-25 18:19:23,040 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-11-25 18:19:25,045 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-11-25 18:19:27,048 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-11-25 18:19:29,053 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-11-25 18:19:31,055 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-11-25 18:19:33,059 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-11-25 18:19:35,074 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-11-25 18:19:37,079 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-11-25 18:19:39,084 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-11-25 18:19:41,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:19:43,099 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-11-25 18:19:45,101 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-11-25 18:20:09,594 WARN L233 SmtUtils]: Spent 8.03s 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-11-25 18:20:25,701 WARN L233 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:20:39,922 WARN L233 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:20:50,021 WARN L233 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:20:52,072 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_39| Int)) (not (= |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_39| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_39|) 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_39| Int)) (not (= 16 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_39|) 0))))) (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21|) |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21|))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_21|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21|) (+ 16 |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_21|)))))) is different from true [2022-11-25 18:21:04,181 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:21:16,288 WARN L233 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:21:18,644 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-11-25 18:21:20,648 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-11-25 18:21:22,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:21:24,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:21:26,667 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-11-25 18:21:27,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:21:27,615 INFO L93 Difference]: Finished difference Result 722 states and 833 transitions. [2022-11-25 18:21:27,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-25 18:21:27,615 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 36 states have (on average 4.805555555555555) internal successors, (173), 37 states have internal predecessors, (173), 17 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 13 states have call predecessors, (27), 17 states have call successors, (27) Word has length 113 [2022-11-25 18:21:27,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:21:27,618 INFO L225 Difference]: With dead ends: 722 [2022-11-25 18:21:27,618 INFO L226 Difference]: Without dead ends: 491 [2022-11-25 18:21:27,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 222 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 202.8s TimeCoverageRelationStatistics Valid=481, Invalid=3019, Unknown=56, NotChecked=476, Total=4032 [2022-11-25 18:21:27,621 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 134 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 1826 mSolverCounterSat, 132 mSolverCounterUnsat, 74 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 150.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 2664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1826 IncrementalHoareTripleChecker+Invalid, 74 IncrementalHoareTripleChecker+Unknown, 632 IncrementalHoareTripleChecker+Unchecked, 150.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:21:27,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1344 Invalid, 2664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1826 Invalid, 74 Unknown, 632 Unchecked, 150.3s Time] [2022-11-25 18:21:27,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-11-25 18:21:27,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 464. [2022-11-25 18:21:27,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 366 states have (on average 1.0683060109289617) internal successors, (391), 376 states have internal predecessors, (391), 56 states have call successors, (56), 38 states have call predecessors, (56), 41 states have return successors, (70), 49 states have call predecessors, (70), 53 states have call successors, (70) [2022-11-25 18:21:27,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 517 transitions. [2022-11-25 18:21:27,766 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 517 transitions. Word has length 113 [2022-11-25 18:21:27,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:21:27,766 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 517 transitions. [2022-11-25 18:21:27,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 36 states have (on average 4.805555555555555) internal successors, (173), 37 states have internal predecessors, (173), 17 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 13 states have call predecessors, (27), 17 states have call successors, (27) [2022-11-25 18:21:27,767 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 517 transitions. [2022-11-25 18:21:27,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-25 18:21:27,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:21:27,769 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:21:27,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-25 18:21:27,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:21:27,976 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:21:27,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:27,976 INFO L85 PathProgramCache]: Analyzing trace with hash 610448605, now seen corresponding path program 1 times [2022-11-25 18:21:27,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:27,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204044738] [2022-11-25 18:21:27,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:27,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:28,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:21:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:28,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:21:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:28,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:21:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:28,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:21:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:28,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-25 18:21:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:28,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:21:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:28,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:21:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:28,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 18:21:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:28,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-25 18:21:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:28,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:21:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:28,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 18:21:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:28,312 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-11-25 18:21:28,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:28,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204044738] [2022-11-25 18:21:28,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204044738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:21:28,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:21:28,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:21:28,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714547458] [2022-11-25 18:21:28,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:21:28,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:21:28,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:28,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:21:28,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:21:28,316 INFO L87 Difference]: Start difference. First operand 464 states and 517 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 18:21:28,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:21:28,497 INFO L93 Difference]: Finished difference Result 478 states and 530 transitions. [2022-11-25 18:21:28,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:21:28,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 122 [2022-11-25 18:21:28,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:21:28,500 INFO L225 Difference]: With dead ends: 478 [2022-11-25 18:21:28,500 INFO L226 Difference]: Without dead ends: 476 [2022-11-25 18:21:28,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:21:28,502 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 7 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:21:28,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 284 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:21:28,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-11-25 18:21:28,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2022-11-25 18:21:28,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 375 states have (on average 1.0666666666666667) internal successors, (400), 385 states have internal predecessors, (400), 56 states have call successors, (56), 41 states have call predecessors, (56), 44 states have return successors, (70), 49 states have call predecessors, (70), 53 states have call successors, (70) [2022-11-25 18:21:28,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 526 transitions. [2022-11-25 18:21:28,659 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 526 transitions. Word has length 122 [2022-11-25 18:21:28,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:21:28,660 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 526 transitions. [2022-11-25 18:21:28,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 18:21:28,660 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 526 transitions. [2022-11-25 18:21:28,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-25 18:21:28,662 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:21:28,662 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:21:28,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-25 18:21:28,662 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:21:28,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:28,663 INFO L85 PathProgramCache]: Analyzing trace with hash -790341988, now seen corresponding path program 2 times [2022-11-25 18:21:28,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:28,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215528196] [2022-11-25 18:21:28,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:28,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:29,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:21:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:29,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:21:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:29,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 18:21:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:30,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:21:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:30,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:21:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:30,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 18:21:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:30,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 18:21:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:30,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:21:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:30,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:21:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:30,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-25 18:21:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:30,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-25 18:21:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:30,434 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 13 proven. 46 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-11-25 18:21:30,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:30,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215528196] [2022-11-25 18:21:30,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215528196] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:21:30,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442770819] [2022-11-25 18:21:30,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:21:30,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:21:30,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:21:30,439 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:21:30,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-25 18:21:30,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:21:30,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:21:30,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-25 18:21:30,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:21:30,922 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:21:30,922 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-11-25 18:21:30,939 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:21:30,939 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-11-25 18:21:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 92 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-25 18:21:32,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:21:32,898 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 49 proven. 10 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-11-25 18:21:32,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442770819] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:21:32,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:21:32,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 11] total 34 [2022-11-25 18:21:32,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892546346] [2022-11-25 18:21:32,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:21:32,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-25 18:21:32,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:32,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-25 18:21:32,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=989, Unknown=0, NotChecked=0, Total=1122 [2022-11-25 18:21:32,901 INFO L87 Difference]: Start difference. First operand 476 states and 526 transitions. Second operand has 34 states, 33 states have (on average 4.212121212121212) internal successors, (139), 33 states have internal predecessors, (139), 10 states have call successors, (25), 4 states have call predecessors, (25), 8 states have return successors, (25), 9 states have call predecessors, (25), 9 states have call successors, (25) [2022-11-25 18:21:34,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:21:34,529 INFO L93 Difference]: Finished difference Result 540 states and 599 transitions. [2022-11-25 18:21:34,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 18:21:34,530 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 4.212121212121212) internal successors, (139), 33 states have internal predecessors, (139), 10 states have call successors, (25), 4 states have call predecessors, (25), 8 states have return successors, (25), 9 states have call predecessors, (25), 9 states have call successors, (25) Word has length 124 [2022-11-25 18:21:34,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:21:34,533 INFO L225 Difference]: With dead ends: 540 [2022-11-25 18:21:34,533 INFO L226 Difference]: Without dead ends: 476 [2022-11-25 18:21:34,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 245 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=309, Invalid=1671, Unknown=0, NotChecked=0, Total=1980 [2022-11-25 18:21:34,535 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 189 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:21:34,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 833 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 18:21:34,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-11-25 18:21:34,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2022-11-25 18:21:34,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 375 states have (on average 1.064) internal successors, (399), 385 states have internal predecessors, (399), 56 states have call successors, (56), 41 states have call predecessors, (56), 44 states have return successors, (70), 49 states have call predecessors, (70), 53 states have call successors, (70) [2022-11-25 18:21:34,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 525 transitions. [2022-11-25 18:21:34,648 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 525 transitions. Word has length 124 [2022-11-25 18:21:34,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:21:34,648 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 525 transitions. [2022-11-25 18:21:34,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.212121212121212) internal successors, (139), 33 states have internal predecessors, (139), 10 states have call successors, (25), 4 states have call predecessors, (25), 8 states have return successors, (25), 9 states have call predecessors, (25), 9 states have call successors, (25) [2022-11-25 18:21:34,649 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 525 transitions. [2022-11-25 18:21:34,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-25 18:21:34,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:21:34,650 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:21:34,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-25 18:21:34,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:21:34,858 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:21:34,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:34,858 INFO L85 PathProgramCache]: Analyzing trace with hash -532176550, now seen corresponding path program 1 times [2022-11-25 18:21:34,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:34,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295603400] [2022-11-25 18:21:34,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:34,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:35,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:21:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:35,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-25 18:21:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:35,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 18:21:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:35,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:21:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:35,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:21:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:35,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-25 18:21:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:35,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-25 18:21:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:35,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-25 18:21:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:35,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-25 18:21:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:35,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-25 18:21:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:35,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-25 18:21:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 10 proven. 55 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-11-25 18:21:35,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:35,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295603400] [2022-11-25 18:21:35,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295603400] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:21:35,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236958539] [2022-11-25 18:21:35,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:35,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:21:35,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:21:35,811 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:21:35,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e63e3355-2aaf-42e6-9312-f995a7e9a23b/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-25 18:21:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:36,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-25 18:21:36,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:21:36,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-25 18:21:36,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:21:36,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 18:21:36,486 INFO L321 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2022-11-25 18:21:36,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 100 [2022-11-25 18:21:36,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:21:36,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 72 [2022-11-25 18:21:36,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-11-25 18:21:36,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:21:36,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 23 [2022-11-25 18:21:36,530 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 13 treesize of output 9 [2022-11-25 18:21:38,586 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_93| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_93|) 0))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_93|) (not (= .cse0 0))))) is different from true [2022-11-25 18:21:49,026 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_94| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_94|) 0))) (and (not (= .cse0 0)) (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_end_harness_~#list~0#1.base_BEFORE_CALL_94|)))) is different from true [2022-11-25 18:21:51,153 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_46| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_46|) 0))) (and (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_46|) (not (= .cse0 0))))) is different from true [2022-11-25 18:21:55,503 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_47| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_47|) 0))) (and (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_47|) (not (= .cse0 0))))) is different from true [2022-11-25 18:21:57,598 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_48| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_48|) 0))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_end_~list#1.base_BEFORE_CALL_48|) (not (= .cse0 0))))) is different from true [2022-11-25 18:22:15,941 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 97 trivial. 11 not checked. [2022-11-25 18:22:15,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:22:26,512 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:22:26,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2022-11-25 18:22:26,533 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:22:26,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 154 [2022-11-25 18:22:26,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 140 [2022-11-25 18:22:26,549 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 140 treesize of output 138 [2022-11-25 18:22:26,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-25 18:22:26,672 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 24 treesize of output 22 [2022-11-25 18:22:26,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-25 18:22:26,693 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:22:26,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 59 [2022-11-25 18:22:26,906 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-25 18:22:26,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236958539] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:22:26,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:22:26,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 11] total 36 [2022-11-25 18:22:26,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789814114] [2022-11-25 18:22:26,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:22:26,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-25 18:22:26,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:22:26,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-25 18:22:26,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=820, Unknown=22, NotChecked=310, Total=1260 [2022-11-25 18:22:26,909 INFO L87 Difference]: Start difference. First operand 476 states and 525 transitions. Second operand has 36 states, 36 states have (on average 3.9722222222222223) internal successors, (143), 33 states have internal predecessors, (143), 13 states have call successors, (26), 7 states have call predecessors, (26), 8 states have return successors, (25), 13 states have call predecessors, (25), 12 states have call successors, (25) [2022-11-25 18:22:29,401 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-11-25 18:22:31,404 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-11-25 18:22:37,523 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-11-25 18:22:39,526 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-11-25 18:22:55,684 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-11-25 18:22:57,693 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-11-25 18:22:59,695 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-11-25 18:23:01,698 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-11-25 18:23:21,940 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-11-25 18:23:23,942 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-11-25 18:23:25,945 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-11-25 18:23:36,106 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-11-25 18:23:38,110 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-11-25 18:23:40,114 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-11-25 18:23:48,231 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-11-25 18:23:50,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:23:52,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:23:54,282 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-11-25 18:23:56,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-11-25 18:23:58,290 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-11-25 18:24:00,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-11-25 18:24:02,308 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-11-25 18:24:04,310 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-11-25 18:24:06,334 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-11-25 18:24:08,337 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-11-25 18:24:18,395 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-11-25 18:24:20,398 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-11-25 18:24:28,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 18:24:30,535 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-11-25 18:24:38,614 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-11-25 18:24:40,615 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-11-25 18:24:46,777 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]