./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash bcbdd24aa3539f554995115754c17957131f4a70e9c01f3bd768b3e606eed4d4 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 15:30:17,867 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 15:30:17,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 15:30:17,888 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 15:30:17,888 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 15:30:17,889 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 15:30:17,890 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 15:30:17,892 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 15:30:17,894 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 15:30:17,894 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 15:30:17,895 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 15:30:17,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 15:30:17,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 15:30:17,898 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 15:30:17,899 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 15:30:17,900 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 15:30:17,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 15:30:17,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 15:30:17,903 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 15:30:17,905 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 15:30:17,906 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 15:30:17,907 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 15:30:17,908 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 15:30:17,909 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 15:30:17,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 15:30:17,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 15:30:17,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 15:30:17,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 15:30:17,914 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 15:30:17,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 15:30:17,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 15:30:17,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 15:30:17,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 15:30:17,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 15:30:17,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 15:30:17,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 15:30:17,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 15:30:17,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 15:30:17,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 15:30:17,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 15:30:17,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 15:30:17,921 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-12-13 15:30:17,947 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 15:30:17,947 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 15:30:17,947 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 15:30:17,947 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 15:30:17,953 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 15:30:17,953 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 15:30:17,954 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 15:30:17,954 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 15:30:17,954 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 15:30:17,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 15:30:17,954 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 15:30:17,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 15:30:17,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 15:30:17,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 15:30:17,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 15:30:17,955 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 15:30:17,955 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 15:30:17,955 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 15:30:17,955 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 15:30:17,956 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 15:30:17,956 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 15:30:17,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:30:17,956 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 15:30:17,956 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 15:30:17,956 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 15:30:17,957 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 15:30:17,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 15:30:17,957 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 15:30:17,957 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 15:30:17,957 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 15:30:17,957 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 15:30:17,958 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 15:30:17,958 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_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bcbdd24aa3539f554995115754c17957131f4a70e9c01f3bd768b3e606eed4d4 [2022-12-13 15:30:18,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 15:30:18,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 15:30:18,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 15:30:18,157 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 15:30:18,158 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 15:30:18,159 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i [2022-12-13 15:30:20,730 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 15:30:21,082 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 15:30:21,083 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i [2022-12-13 15:30:21,102 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/data/2f1f7eceb/0eff0e9d79404cd1a5ef098f803a67ac/FLAG8fe58ac1e [2022-12-13 15:30:21,306 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/data/2f1f7eceb/0eff0e9d79404cd1a5ef098f803a67ac [2022-12-13 15:30:21,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 15:30:21,309 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 15:30:21,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 15:30:21,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 15:30:21,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 15:30:21,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:30:21" (1/1) ... [2022-12-13 15:30:21,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e0f39d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:30:21, skipping insertion in model container [2022-12-13 15:30:21,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:30:21" (1/1) ... [2022-12-13 15:30:21,318 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 15:30:21,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 15:30:21,612 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_10a0ede3-c856-41dc-9118-f597630f17fe/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4498,4511] [2022-12-13 15:30:21,620 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_10a0ede3-c856-41dc-9118-f597630f17fe/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4558,4571] [2022-12-13 15:30:22,284 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 15:30:22,290 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:30:22,291 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:30:22,291 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:30:22,292 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:30:22,293 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:30:22,305 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:30:22,306 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:30:22,307 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:30:22,308 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:30:22,309 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:30:22,310 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:30:22,311 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:30:22,311 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:30:22,368 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 15:30:22,368 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 15:30:22,369 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 15:30:22,373 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-12-13 15:30:22,374 WARN L623 FunctionHandler]: Unknown extern function htons [2022-12-13 15:30:22,375 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-12-13 15:30:22,592 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-12-13 15:30:22,593 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-12-13 15:30:22,594 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-12-13 15:30:22,594 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-12-13 15:30:22,595 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-12-13 15:30:22,596 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-12-13 15:30:22,597 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-12-13 15:30:22,597 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-12-13 15:30:22,598 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-12-13 15:30:22,598 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-12-13 15:30:22,599 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-12-13 15:30:22,708 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-12-13 15:30:22,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:30:22,742 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 15:30:22,754 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_10a0ede3-c856-41dc-9118-f597630f17fe/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4498,4511] [2022-12-13 15:30:22,755 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_10a0ede3-c856-41dc-9118-f597630f17fe/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4558,4571] [2022-12-13 15:30:22,792 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 15:30:22,795 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:30:22,795 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:30:22,796 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:30:22,796 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:30:22,797 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:30:22,804 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:30:22,805 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:30:22,806 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:30:22,806 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:30:22,807 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:30:22,808 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:30:22,808 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:30:22,809 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 15:30:22,816 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 15:30:22,817 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 15:30:22,817 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 15:30:22,821 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-12-13 15:30:22,822 WARN L623 FunctionHandler]: Unknown extern function htons [2022-12-13 15:30:22,822 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-12-13 15:30:22,874 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-12-13 15:30:22,875 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-12-13 15:30:22,876 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-12-13 15:30:22,877 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-12-13 15:30:22,878 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-12-13 15:30:22,880 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-12-13 15:30:22,880 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-12-13 15:30:22,881 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-12-13 15:30:22,881 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-12-13 15:30:22,882 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-12-13 15:30:22,882 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-12-13 15:30:22,906 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-12-13 15:30:22,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:30:23,051 INFO L208 MainTranslator]: Completed translation [2022-12-13 15:30:23,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:30:23 WrapperNode [2022-12-13 15:30:23,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 15:30:23,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 15:30:23,053 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 15:30:23,053 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 15:30:23,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:30:23" (1/1) ... [2022-12-13 15:30:23,112 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:30:23" (1/1) ... [2022-12-13 15:30:23,148 INFO L138 Inliner]: procedures = 679, calls = 1045, calls flagged for inlining = 52, calls inlined = 8, statements flattened = 224 [2022-12-13 15:30:23,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 15:30:23,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 15:30:23,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 15:30:23,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 15:30:23,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:30:23" (1/1) ... [2022-12-13 15:30:23,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:30:23" (1/1) ... [2022-12-13 15:30:23,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:30:23" (1/1) ... [2022-12-13 15:30:23,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:30:23" (1/1) ... [2022-12-13 15:30:23,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:30:23" (1/1) ... [2022-12-13 15:30:23,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:30:23" (1/1) ... [2022-12-13 15:30:23,194 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:30:23" (1/1) ... [2022-12-13 15:30:23,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:30:23" (1/1) ... [2022-12-13 15:30:23,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 15:30:23,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 15:30:23,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 15:30:23,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 15:30:23,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:30:23" (1/1) ... [2022-12-13 15:30:23,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:30:23,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:30:23,234 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 15:30:23,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 15:30:23,262 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2022-12-13 15:30:23,262 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2022-12-13 15:30:23,262 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2022-12-13 15:30:23,262 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2022-12-13 15:30:23,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 15:30:23,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 15:30:23,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-13 15:30:23,263 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-13 15:30:23,263 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-12-13 15:30:23,263 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-12-13 15:30:23,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 15:30:23,263 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-12-13 15:30:23,263 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-12-13 15:30:23,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 15:30:23,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 15:30:23,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 15:30:23,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 15:30:23,264 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2022-12-13 15:30:23,264 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2022-12-13 15:30:23,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-12-13 15:30:23,264 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-12-13 15:30:23,264 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 15:30:23,264 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 15:30:23,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 15:30:23,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 15:30:23,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 15:30:23,265 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-12-13 15:30:23,265 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-12-13 15:30:23,265 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-12-13 15:30:23,265 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-12-13 15:30:23,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 15:30:23,454 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 15:30:23,455 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 15:30:23,732 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 15:30:23,737 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 15:30:23,738 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-13 15:30:23,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:30:23 BoogieIcfgContainer [2022-12-13 15:30:23,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 15:30:23,741 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 15:30:23,741 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 15:30:23,743 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 15:30:23,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:30:21" (1/3) ... [2022-12-13 15:30:23,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4e0700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:30:23, skipping insertion in model container [2022-12-13 15:30:23,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:30:23" (2/3) ... [2022-12-13 15:30:23,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4e0700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:30:23, skipping insertion in model container [2022-12-13 15:30:23,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:30:23" (3/3) ... [2022-12-13 15:30:23,745 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_pop_back_harness.i [2022-12-13 15:30:23,759 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 15:30:23,759 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 15:30:23,795 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 15:30:23,799 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;@4efc5128, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 15:30:23,799 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 15:30:23,803 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 89 states have (on average 1.303370786516854) internal successors, (116), 90 states have internal predecessors, (116), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-12-13 15:30:23,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-13 15:30:23,811 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:30:23,811 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:30:23,812 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:30:23,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:30:23,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1579343520, now seen corresponding path program 1 times [2022-12-13 15:30:23,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:30:23,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686416629] [2022-12-13 15:30:23,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:30:23,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:30:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:24,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:30:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:24,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 15:30:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:24,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 15:30:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:24,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:30:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:24,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 15:30:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:24,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 15:30:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:24,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:30:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:24,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:30:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:24,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 15:30:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:24,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 15:30:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:24,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 15:30:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:24,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 15:30:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:24,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 15:30:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:24,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:30:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:24,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-12-13 15:30:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:24,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-12-13 15:30:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:24,425 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-12-13 15:30:24,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:30:24,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686416629] [2022-12-13 15:30:24,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686416629] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:30:24,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778508193] [2022-12-13 15:30:24,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:30:24,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:30:24,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:30:24,428 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:30:24,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 15:30:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:24,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:30:24,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:30:24,641 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-12-13 15:30:24,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:30:24,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778508193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:30:24,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:30:24,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-12-13 15:30:24,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487824755] [2022-12-13 15:30:24,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:30:24,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:30:24,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:30:24,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:30:24,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:30:24,702 INFO L87 Difference]: Start difference. First operand has 137 states, 89 states have (on average 1.303370786516854) internal successors, (116), 90 states have internal predecessors, (116), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 15:30:24,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:30:24,772 INFO L93 Difference]: Finished difference Result 274 states and 414 transitions. [2022-12-13 15:30:24,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:30:24,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2022-12-13 15:30:24,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:30:24,783 INFO L225 Difference]: With dead ends: 274 [2022-12-13 15:30:24,784 INFO L226 Difference]: Without dead ends: 140 [2022-12-13 15:30:24,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:30:24,791 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 12 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:30:24,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 536 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:30:24,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-12-13 15:30:24,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 134. [2022-12-13 15:30:24,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 86 states have (on average 1.244186046511628) internal successors, (107), 87 states have internal predecessors, (107), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-12-13 15:30:24,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 180 transitions. [2022-12-13 15:30:24,833 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 180 transitions. Word has length 116 [2022-12-13 15:30:24,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:30:24,835 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 180 transitions. [2022-12-13 15:30:24,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 15:30:24,835 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 180 transitions. [2022-12-13 15:30:24,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-13 15:30:24,838 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:30:24,839 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:30:24,845 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 15:30:25,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-12-13 15:30:25,041 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:30:25,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:30:25,043 INFO L85 PathProgramCache]: Analyzing trace with hash -183799078, now seen corresponding path program 1 times [2022-12-13 15:30:25,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:30:25,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952597300] [2022-12-13 15:30:25,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:30:25,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:30:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:25,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:30:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:25,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 15:30:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:25,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 15:30:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:25,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:30:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:25,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 15:30:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:25,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 15:30:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:25,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:30:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:25,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:30:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:25,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 15:30:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:25,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 15:30:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:25,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 15:30:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:25,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 15:30:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:25,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 15:30:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:25,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:30:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:25,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-12-13 15:30:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:25,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-12-13 15:30:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2022-12-13 15:30:25,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:30:25,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952597300] [2022-12-13 15:30:25,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952597300] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:30:25,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165883300] [2022-12-13 15:30:25,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:30:25,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:30:25,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:30:25,416 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:30:25,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 15:30:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:25,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:30:25,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:30:25,590 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-12-13 15:30:25,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:30:25,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165883300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:30:25,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:30:25,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-12-13 15:30:25,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72828918] [2022-12-13 15:30:25,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:30:25,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:30:25,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:30:25,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:30:25,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:30:25,593 INFO L87 Difference]: Start difference. First operand 134 states and 180 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 15:30:25,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:30:25,632 INFO L93 Difference]: Finished difference Result 252 states and 345 transitions. [2022-12-13 15:30:25,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:30:25,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2022-12-13 15:30:25,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:30:25,635 INFO L225 Difference]: With dead ends: 252 [2022-12-13 15:30:25,635 INFO L226 Difference]: Without dead ends: 138 [2022-12-13 15:30:25,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:30:25,637 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 3 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:30:25,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 520 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:30:25,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-12-13 15:30:25,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2022-12-13 15:30:25,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 90 states have internal predecessors, (110), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-12-13 15:30:25,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 183 transitions. [2022-12-13 15:30:25,653 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 183 transitions. Word has length 116 [2022-12-13 15:30:25,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:30:25,653 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 183 transitions. [2022-12-13 15:30:25,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 15:30:25,654 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 183 transitions. [2022-12-13 15:30:25,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-13 15:30:25,656 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:30:25,656 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:30:25,663 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 15:30:25,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:30:25,857 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:30:25,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:30:25,858 INFO L85 PathProgramCache]: Analyzing trace with hash -543175276, now seen corresponding path program 1 times [2022-12-13 15:30:25,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:30:25,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974083931] [2022-12-13 15:30:25,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:30:25,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:30:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:26,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:30:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:26,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 15:30:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:26,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 15:30:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:26,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:30:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:26,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 15:30:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:26,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 15:30:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:26,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:30:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:26,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:30:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:26,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 15:30:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:26,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 15:30:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:26,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 15:30:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:26,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 15:30:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:26,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 15:30:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:26,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:30:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:26,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-12-13 15:30:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:26,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-12-13 15:30:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:26,927 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-12-13 15:30:26,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:30:26,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974083931] [2022-12-13 15:30:26,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974083931] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:30:26,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048313087] [2022-12-13 15:30:26,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:30:26,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:30:26,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:30:26,929 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:30:26,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 15:30:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:27,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-13 15:30:27,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:30:27,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:30:27,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-12-13 15:30:27,746 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-12-13 15:30:27,746 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:30:27,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048313087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:30:27,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:30:27,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2022-12-13 15:30:27,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489100351] [2022-12-13 15:30:27,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:30:27,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 15:30:27,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:30:27,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 15:30:27,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2022-12-13 15:30:27,749 INFO L87 Difference]: Start difference. First operand 137 states and 183 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-12-13 15:30:28,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:30:28,537 INFO L93 Difference]: Finished difference Result 374 states and 504 transitions. [2022-12-13 15:30:28,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 15:30:28,538 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 116 [2022-12-13 15:30:28,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:30:28,543 INFO L225 Difference]: With dead ends: 374 [2022-12-13 15:30:28,543 INFO L226 Difference]: Without dead ends: 257 [2022-12-13 15:30:28,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 133 SyntacticMatches, 8 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2022-12-13 15:30:28,546 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 188 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 15:30:28,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 878 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 15:30:28,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-12-13 15:30:28,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 231. [2022-12-13 15:30:28,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 153 states have (on average 1.2418300653594772) internal successors, (190), 156 states have internal predecessors, (190), 60 states have call successors, (60), 17 states have call predecessors, (60), 17 states have return successors, (61), 57 states have call predecessors, (61), 59 states have call successors, (61) [2022-12-13 15:30:28,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 311 transitions. [2022-12-13 15:30:28,581 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 311 transitions. Word has length 116 [2022-12-13 15:30:28,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:30:28,582 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 311 transitions. [2022-12-13 15:30:28,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-12-13 15:30:28,582 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 311 transitions. [2022-12-13 15:30:28,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-13 15:30:28,586 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:30:28,586 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:30:28,593 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 15:30:28,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:30:28,787 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:30:28,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:30:28,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1369878566, now seen corresponding path program 1 times [2022-12-13 15:30:28,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:30:28,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134845470] [2022-12-13 15:30:28,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:30:28,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:30:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:29,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:30:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:29,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 15:30:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:29,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 15:30:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:29,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:30:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:29,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 15:30:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:29,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 15:30:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:29,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:30:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:29,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:30:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:29,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 15:30:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:29,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 15:30:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:29,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 15:30:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:29,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 15:30:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:29,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 15:30:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:29,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:30:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:29,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-12-13 15:30:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:29,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-12-13 15:30:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-12-13 15:30:29,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:30:29,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134845470] [2022-12-13 15:30:29,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134845470] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:30:29,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811400577] [2022-12-13 15:30:29,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:30:29,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:30:29,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:30:29,473 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:30:29,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 15:30:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:29,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-13 15:30:29,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:30:29,676 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 15:30:29,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 15:30:29,688 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 15:30:29,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 15:30:30,844 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 105 proven. 17 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-12-13 15:30:30,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:30:31,191 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-12-13 15:30:31,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811400577] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:30:31,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:30:31,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 12] total 28 [2022-12-13 15:30:31,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158341425] [2022-12-13 15:30:31,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:30:31,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 15:30:31,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:30:31,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 15:30:31,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2022-12-13 15:30:31,195 INFO L87 Difference]: Start difference. First operand 231 states and 311 transitions. Second operand has 28 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 26 states have internal predecessors, (104), 10 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (33), 10 states have call predecessors, (33), 10 states have call successors, (33) [2022-12-13 15:30:33,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:30:35,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:30:37,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:30:41,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:30:43,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:30:45,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:30:45,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:30:45,700 INFO L93 Difference]: Finished difference Result 718 states and 979 transitions. [2022-12-13 15:30:45,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-13 15:30:45,701 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 26 states have internal predecessors, (104), 10 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (33), 10 states have call predecessors, (33), 10 states have call successors, (33) Word has length 116 [2022-12-13 15:30:45,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:30:45,705 INFO L225 Difference]: With dead ends: 718 [2022-12-13 15:30:45,705 INFO L226 Difference]: Without dead ends: 523 [2022-12-13 15:30:45,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 241 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=444, Invalid=2208, Unknown=0, NotChecked=0, Total=2652 [2022-12-13 15:30:45,708 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 366 mSDsluCounter, 2210 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 182 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 2418 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2022-12-13 15:30:45,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 2418 Invalid, 1784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 1596 Invalid, 6 Unknown, 0 Unchecked, 13.4s Time] [2022-12-13 15:30:45,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-12-13 15:30:45,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 444. [2022-12-13 15:30:45,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 302 states have (on average 1.2384105960264902) internal successors, (374), 305 states have internal predecessors, (374), 109 states have call successors, (109), 34 states have call predecessors, (109), 32 states have return successors, (118), 104 states have call predecessors, (118), 107 states have call successors, (118) [2022-12-13 15:30:45,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 601 transitions. [2022-12-13 15:30:45,758 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 601 transitions. Word has length 116 [2022-12-13 15:30:45,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:30:45,758 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 601 transitions. [2022-12-13 15:30:45,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 26 states have internal predecessors, (104), 10 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (33), 10 states have call predecessors, (33), 10 states have call successors, (33) [2022-12-13 15:30:45,759 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 601 transitions. [2022-12-13 15:30:45,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-13 15:30:45,761 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:30:45,762 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:30:45,767 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 15:30:45,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:30:45,962 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:30:45,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:30:45,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1275142702, now seen corresponding path program 1 times [2022-12-13 15:30:45,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:30:45,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764126872] [2022-12-13 15:30:45,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:30:45,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:30:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:46,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:30:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:46,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 15:30:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:46,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 15:30:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:46,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:30:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:46,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 15:30:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:46,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 15:30:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:46,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:30:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:46,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:30:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:46,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 15:30:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:46,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 15:30:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:46,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 15:30:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:46,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 15:30:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:46,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 15:30:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:46,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:30:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:46,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-12-13 15:30:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:46,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-12-13 15:30:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:46,233 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-12-13 15:30:46,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:30:46,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764126872] [2022-12-13 15:30:46,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764126872] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:30:46,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911755378] [2022-12-13 15:30:46,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:30:46,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:30:46,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:30:46,235 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:30:46,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 15:30:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:46,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 15:30:46,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:30:46,448 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-12-13 15:30:46,448 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:30:46,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911755378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:30:46,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:30:46,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2022-12-13 15:30:46,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894916761] [2022-12-13 15:30:46,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:30:46,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 15:30:46,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:30:46,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 15:30:46,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-13 15:30:46,450 INFO L87 Difference]: Start difference. First operand 444 states and 601 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-12-13 15:30:46,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:30:46,633 INFO L93 Difference]: Finished difference Result 894 states and 1212 transitions. [2022-12-13 15:30:46,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:30:46,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 116 [2022-12-13 15:30:46,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:30:46,638 INFO L225 Difference]: With dead ends: 894 [2022-12-13 15:30:46,638 INFO L226 Difference]: Without dead ends: 438 [2022-12-13 15:30:46,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 143 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-12-13 15:30:46,641 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 206 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:30:46,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 728 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:30:46,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-12-13 15:30:46,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 421. [2022-12-13 15:30:46,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 298 states have (on average 1.261744966442953) internal successors, (376), 303 states have internal predecessors, (376), 91 states have call successors, (91), 30 states have call predecessors, (91), 31 states have return successors, (102), 87 states have call predecessors, (102), 89 states have call successors, (102) [2022-12-13 15:30:46,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 569 transitions. [2022-12-13 15:30:46,690 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 569 transitions. Word has length 116 [2022-12-13 15:30:46,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:30:46,691 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 569 transitions. [2022-12-13 15:30:46,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-12-13 15:30:46,691 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 569 transitions. [2022-12-13 15:30:46,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-12-13 15:30:46,694 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:30:46,694 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:30:46,700 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 15:30:46,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:30:46,896 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:30:46,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:30:46,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1492302642, now seen corresponding path program 1 times [2022-12-13 15:30:46,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:30:46,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393803718] [2022-12-13 15:30:46,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:30:46,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:30:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:47,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:30:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:47,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 15:30:47,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:47,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 15:30:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:47,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:30:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:47,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 15:30:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:47,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 15:30:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:47,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:30:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:47,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 15:30:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:47,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 15:30:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:47,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 15:30:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:47,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 15:30:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:47,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 15:30:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:47,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 15:30:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:47,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:30:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:47,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 15:30:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:47,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-12-13 15:30:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-12-13 15:30:47,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:30:47,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393803718] [2022-12-13 15:30:47,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393803718] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:30:47,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317151339] [2022-12-13 15:30:47,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:30:47,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:30:47,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:30:47,249 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:30:47,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 15:30:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:47,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-13 15:30:47,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:30:47,407 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 6 treesize of output 5 [2022-12-13 15:30:47,530 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 15:30:47,531 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 15:30:47,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-13 15:30:47,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 15:30:47,597 INFO L321 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2022-12-13 15:30:47,598 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 73 treesize of output 99 [2022-12-13 15:30:47,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:30:47,603 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 85 treesize of output 71 [2022-12-13 15:30:47,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-12-13 15:30:47,679 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13|))) (let ((.cse0 (select .cse1 0))) (and (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_2) .cse0)) (= (select .cse1 24) (select v_DerPreprocessor_2 24)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13|)) (not (= .cse0 0)))))) is different from true [2022-12-13 15:30:47,833 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14|))) (let ((.cse0 (select .cse1 0))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14| v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14| v_DerPreprocessor_2) .cse0) (select |c_#memory_$Pointer$.base| .cse0)) (not (= .cse0 0)) (= (select .cse1 24) (select v_DerPreprocessor_2 24)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| Int) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13|))) (let ((.cse2 (select .cse3 0))) (and (= (select |c_#memory_$Pointer$.base| .cse2) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_4) .cse2 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_4) .cse2)) (= (select .cse3 24) (select v_DerPreprocessor_4 24)) (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13|)) (not (= .cse2 0))))))) is different from true [2022-12-13 15:30:48,161 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14|))) (let ((.cse0 (select .cse1 0))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14| v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14| v_DerPreprocessor_2) .cse0) (select |c_#memory_$Pointer$.base| .cse0)) (not (= .cse0 0)) (= (select .cse1 24) (select v_DerPreprocessor_2 24)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| Int) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13|))) (let ((.cse2 (select .cse3 0))) (and (= (select |c_#memory_$Pointer$.base| .cse2) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_4) .cse2 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_4) .cse2)) (= (select .cse3 24) (select v_DerPreprocessor_4 24)) (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13|)) (not (= .cse2 0)))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| Int) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15|))) (let ((.cse4 (select .cse5 0))) (and (not (= .cse4 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_8) .cse4 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_8) .cse4) (select |c_#memory_$Pointer$.base| .cse4)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| .cse4)) (= (select .cse5 24) (select v_DerPreprocessor_8 24)))))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10| Int)) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10|))) (let ((.cse6 (select .cse7 0))) (and (not (= .cse6 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10|)) (= (select .cse7 24) (select v_DerPreprocessor_6 24)) (not (= .cse6 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10| v_DerPreprocessor_6) .cse6 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10| v_DerPreprocessor_6) .cse6) (select |c_#memory_$Pointer$.base| .cse6))))))) is different from true [2022-12-13 15:30:48,644 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14|))) (let ((.cse0 (select .cse1 0))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14| v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14| v_DerPreprocessor_2) .cse0) (select |c_#memory_$Pointer$.base| .cse0)) (not (= .cse0 0)) (= (select .cse1 24) (select v_DerPreprocessor_2 24)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| Int) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13|))) (let ((.cse2 (select .cse3 0))) (and (= (select |c_#memory_$Pointer$.base| .cse2) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_4) .cse2 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_4) .cse2)) (= (select .cse3 24) (select v_DerPreprocessor_4 24)) (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13|)) (not (= .cse2 0)))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| Int)) (let ((.cse4 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11|))) (let ((.cse5 (select .cse4 0))) (and (= (select v_DerPreprocessor_10 24) (select .cse4 24)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| .cse5)) (not (= .cse5 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| v_DerPreprocessor_10) .cse5 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| v_DerPreprocessor_10) .cse5) (select |c_#memory_$Pointer$.base| .cse5)))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| Int) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15|))) (let ((.cse6 (select .cse7 0))) (and (not (= .cse6 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_8) .cse6 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_8) .cse6) (select |c_#memory_$Pointer$.base| .cse6)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| .cse6)) (= (select .cse7 24) (select v_DerPreprocessor_8 24)))))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10| Int)) (let ((.cse9 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10|))) (let ((.cse8 (select .cse9 0))) (and (not (= .cse8 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10|)) (= (select .cse9 24) (select v_DerPreprocessor_6 24)) (not (= .cse8 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10| v_DerPreprocessor_6) .cse8 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10| v_DerPreprocessor_6) .cse8) (select |c_#memory_$Pointer$.base| .cse8))))))) is different from true [2022-12-13 15:30:49,086 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14|))) (let ((.cse0 (select .cse1 0))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14| v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14| v_DerPreprocessor_2) .cse0) (select |c_#memory_$Pointer$.base| .cse0)) (not (= .cse0 0)) (= (select .cse1 24) (select v_DerPreprocessor_2 24)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| Int) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13|))) (let ((.cse2 (select .cse3 0))) (and (= (select |c_#memory_$Pointer$.base| .cse2) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_4) .cse2 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_4) .cse2)) (= (select .cse3 24) (select v_DerPreprocessor_4 24)) (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13|)) (not (= .cse2 0)))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| Int)) (let ((.cse4 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11|))) (let ((.cse5 (select .cse4 0))) (and (= (select v_DerPreprocessor_10 24) (select .cse4 24)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| .cse5)) (not (= .cse5 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| v_DerPreprocessor_10) .cse5 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| v_DerPreprocessor_10) .cse5) (select |c_#memory_$Pointer$.base| .cse5)))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| Int) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15|))) (let ((.cse6 (select .cse7 0))) (and (not (= .cse6 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_8) .cse6 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_8) .cse6) (select |c_#memory_$Pointer$.base| .cse6)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| .cse6)) (= (select .cse7 24) (select v_DerPreprocessor_8 24)))))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10| Int)) (let ((.cse9 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10|))) (let ((.cse8 (select .cse9 0))) (and (not (= .cse8 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10|)) (= (select .cse9 24) (select v_DerPreprocessor_6 24)) (not (= .cse8 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10| v_DerPreprocessor_6) .cse8 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10| v_DerPreprocessor_6) .cse8) (select |c_#memory_$Pointer$.base| .cse8)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12| Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12|))) (let ((.cse11 (select .cse10 0))) (and (= (select .cse10 24) (select v_DerPreprocessor_11 24)) (= (select |c_#memory_$Pointer$.base| .cse11) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_12) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12| v_DerPreprocessor_11) .cse11 v_DerPreprocessor_12) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12| v_DerPreprocessor_11) .cse11)) (not (= .cse11 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12|)) (not (= .cse11 0))))))) is different from true [2022-12-13 15:30:50,184 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 112 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 45 not checked. [2022-12-13 15:30:50,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:30:50,682 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:30:50,683 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-12-13 15:30:50,697 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:30:50,697 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 154 treesize of output 156 [2022-12-13 15:30:50,703 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-12-13 15:30:50,709 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-12-13 15:30:50,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 15:30:50,791 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-12-13 15:30:50,817 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:30:50,818 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 113 treesize of output 105 [2022-12-13 15:30:51,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317151339] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:30:51,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 15:30:51,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 21] total 25 [2022-12-13 15:30:51,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238646018] [2022-12-13 15:30:51,142 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 15:30:51,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 15:30:51,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:30:51,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 15:30:51,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=706, Unknown=33, NotChecked=290, Total=1122 [2022-12-13 15:30:51,143 INFO L87 Difference]: Start difference. First operand 421 states and 569 transitions. Second operand has 25 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 11 states have call successors, (31), 8 states have call predecessors, (31), 10 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2022-12-13 15:30:51,785 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_5| Int)) (= (select |c_#valid| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_5|) 1)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13|))) (let ((.cse0 (select .cse1 0))) (and (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_2) .cse0)) (= (select .cse1 24) (select v_DerPreprocessor_2 24)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13|)) (not (= .cse0 0))))))) is different from true [2022-12-13 15:30:57,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:30:57,026 INFO L93 Difference]: Finished difference Result 985 states and 1320 transitions. [2022-12-13 15:30:57,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-13 15:30:57,027 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 11 states have call successors, (31), 8 states have call predecessors, (31), 10 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) Word has length 118 [2022-12-13 15:30:57,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:30:57,029 INFO L225 Difference]: With dead ends: 985 [2022-12-13 15:30:57,029 INFO L226 Difference]: Without dead ends: 556 [2022-12-13 15:30:57,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 228 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=241, Invalid=2138, Unknown=95, NotChecked=606, Total=3080 [2022-12-13 15:30:57,031 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 247 mSDsluCounter, 3398 mSDsCounter, 0 mSdLazyCounter, 1714 mSolverCounterSat, 89 mSolverCounterUnsat, 163 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 3676 SdHoareTripleChecker+Invalid, 3692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1714 IncrementalHoareTripleChecker+Invalid, 163 IncrementalHoareTripleChecker+Unknown, 1726 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:30:57,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 3676 Invalid, 3692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1714 Invalid, 163 Unknown, 1726 Unchecked, 4.0s Time] [2022-12-13 15:30:57,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-12-13 15:30:57,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 520. [2022-12-13 15:30:57,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 360 states have (on average 1.2277777777777779) internal successors, (442), 366 states have internal predecessors, (442), 112 states have call successors, (112), 45 states have call predecessors, (112), 47 states have return successors, (122), 108 states have call predecessors, (122), 108 states have call successors, (122) [2022-12-13 15:30:57,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 676 transitions. [2022-12-13 15:30:57,070 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 676 transitions. Word has length 118 [2022-12-13 15:30:57,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:30:57,070 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 676 transitions. [2022-12-13 15:30:57,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 11 states have call successors, (31), 8 states have call predecessors, (31), 10 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2022-12-13 15:30:57,070 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 676 transitions. [2022-12-13 15:30:57,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-12-13 15:30:57,072 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:30:57,072 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:30:57,077 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 15:30:57,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:30:57,273 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:30:57,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:30:57,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1991074974, now seen corresponding path program 1 times [2022-12-13 15:30:57,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:30:57,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183103258] [2022-12-13 15:30:57,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:30:57,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:30:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:57,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:30:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:57,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 15:30:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:57,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 15:30:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:57,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:30:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:57,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 15:30:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:57,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 15:30:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:57,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:30:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:57,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:30:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:57,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 15:30:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:57,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 15:30:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:57,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 15:30:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:57,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 15:30:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:57,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 15:30:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:57,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:30:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:57,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 15:30:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:57,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-12-13 15:30:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-12-13 15:30:57,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:30:57,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183103258] [2022-12-13 15:30:57,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183103258] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:30:57,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690664589] [2022-12-13 15:30:57,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:30:57,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:30:57,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:30:57,529 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:30:57,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 15:30:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:57,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 15:30:57,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:30:57,753 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-12-13 15:30:57,753 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:30:57,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690664589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:30:57,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:30:57,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2022-12-13 15:30:57,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185967961] [2022-12-13 15:30:57,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:30:57,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 15:30:57,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:30:57,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 15:30:57,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-12-13 15:30:57,755 INFO L87 Difference]: Start difference. First operand 520 states and 676 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-12-13 15:30:58,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:30:58,007 INFO L93 Difference]: Finished difference Result 940 states and 1251 transitions. [2022-12-13 15:30:58,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 15:30:58,008 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 118 [2022-12-13 15:30:58,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:30:58,011 INFO L225 Difference]: With dead ends: 940 [2022-12-13 15:30:58,011 INFO L226 Difference]: Without dead ends: 535 [2022-12-13 15:30:58,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 144 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-12-13 15:30:58,014 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 219 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 15:30:58,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 735 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 15:30:58,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-12-13 15:30:58,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 520. [2022-12-13 15:30:58,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 360 states have (on average 1.2194444444444446) internal successors, (439), 366 states have internal predecessors, (439), 112 states have call successors, (112), 45 states have call predecessors, (112), 47 states have return successors, (122), 108 states have call predecessors, (122), 108 states have call successors, (122) [2022-12-13 15:30:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 673 transitions. [2022-12-13 15:30:58,078 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 673 transitions. Word has length 118 [2022-12-13 15:30:58,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:30:58,079 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 673 transitions. [2022-12-13 15:30:58,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-12-13 15:30:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 673 transitions. [2022-12-13 15:30:58,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-12-13 15:30:58,081 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:30:58,081 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:30:58,087 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 15:30:58,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:30:58,282 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:30:58,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:30:58,282 INFO L85 PathProgramCache]: Analyzing trace with hash -267467697, now seen corresponding path program 1 times [2022-12-13 15:30:58,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:30:58,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421488065] [2022-12-13 15:30:58,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:30:58,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:30:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:58,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:30:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:58,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 15:30:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:58,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 15:30:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:58,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:30:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:58,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 15:30:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:58,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 15:30:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:58,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:30:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:58,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:30:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:58,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 15:30:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:58,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 15:30:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:58,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 15:30:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:58,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 15:30:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:58,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-12-13 15:30:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:58,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:30:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:58,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 15:30:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:58,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 15:30:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:58,509 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-12-13 15:30:58,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:30:58,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421488065] [2022-12-13 15:30:58,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421488065] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:30:58,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093988128] [2022-12-13 15:30:58,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:30:58,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:30:58,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:30:58,511 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:30:58,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 15:30:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:58,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 15:30:58,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:30:58,767 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-12-13 15:30:58,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:30:58,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093988128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:30:58,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:30:58,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2022-12-13 15:30:58,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745200199] [2022-12-13 15:30:58,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:30:58,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 15:30:58,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:30:58,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 15:30:58,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-12-13 15:30:58,770 INFO L87 Difference]: Start difference. First operand 520 states and 673 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-12-13 15:30:59,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:30:59,098 INFO L93 Difference]: Finished difference Result 1000 states and 1348 transitions. [2022-12-13 15:30:59,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 15:30:59,099 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 120 [2022-12-13 15:30:59,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:30:59,101 INFO L225 Difference]: With dead ends: 1000 [2022-12-13 15:30:59,101 INFO L226 Difference]: Without dead ends: 592 [2022-12-13 15:30:59,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-12-13 15:30:59,103 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 261 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 15:30:59,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 847 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 15:30:59,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-12-13 15:30:59,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 524. [2022-12-13 15:30:59,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 364 states have (on average 1.2197802197802199) internal successors, (444), 370 states have internal predecessors, (444), 112 states have call successors, (112), 45 states have call predecessors, (112), 47 states have return successors, (122), 108 states have call predecessors, (122), 108 states have call successors, (122) [2022-12-13 15:30:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 678 transitions. [2022-12-13 15:30:59,136 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 678 transitions. Word has length 120 [2022-12-13 15:30:59,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:30:59,136 INFO L495 AbstractCegarLoop]: Abstraction has 524 states and 678 transitions. [2022-12-13 15:30:59,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-12-13 15:30:59,137 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 678 transitions. [2022-12-13 15:30:59,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-12-13 15:30:59,138 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:30:59,138 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:30:59,144 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 15:30:59,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-13 15:30:59,340 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:30:59,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:30:59,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1914003673, now seen corresponding path program 1 times [2022-12-13 15:30:59,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:30:59,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234528323] [2022-12-13 15:30:59,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:30:59,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:30:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:59,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:30:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:59,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 15:30:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:59,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 15:30:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:59,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:30:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:59,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 15:30:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:59,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 15:30:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:59,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:30:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:59,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:30:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:59,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 15:30:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:59,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 15:30:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:59,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 15:30:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:59,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 15:30:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:59,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-12-13 15:30:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:59,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:30:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:59,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 15:30:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:59,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-12-13 15:30:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:59,696 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2022-12-13 15:30:59,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:30:59,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234528323] [2022-12-13 15:30:59,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234528323] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:30:59,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858953858] [2022-12-13 15:30:59,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:30:59,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:30:59,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:30:59,698 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:30:59,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 15:30:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:30:59,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 15:30:59,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:30:59,849 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-12-13 15:30:59,849 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:30:59,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858953858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:30:59,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:30:59,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-12-13 15:30:59,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751248887] [2022-12-13 15:30:59,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:30:59,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:30:59,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:30:59,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:30:59,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:30:59,851 INFO L87 Difference]: Start difference. First operand 524 states and 678 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 15:30:59,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:30:59,903 INFO L93 Difference]: Finished difference Result 970 states and 1307 transitions. [2022-12-13 15:30:59,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:30:59,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 121 [2022-12-13 15:30:59,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:30:59,907 INFO L225 Difference]: With dead ends: 970 [2022-12-13 15:30:59,908 INFO L226 Difference]: Without dead ends: 564 [2022-12-13 15:30:59,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:30:59,909 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 6 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 354 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-12-13 15:30:59,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 354 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:30:59,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-12-13 15:30:59,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 532. [2022-12-13 15:30:59,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 372 states have (on average 1.2204301075268817) internal successors, (454), 378 states have internal predecessors, (454), 112 states have call successors, (112), 45 states have call predecessors, (112), 47 states have return successors, (122), 108 states have call predecessors, (122), 108 states have call successors, (122) [2022-12-13 15:30:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 688 transitions. [2022-12-13 15:30:59,953 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 688 transitions. Word has length 121 [2022-12-13 15:30:59,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:30:59,953 INFO L495 AbstractCegarLoop]: Abstraction has 532 states and 688 transitions. [2022-12-13 15:30:59,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-13 15:30:59,953 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 688 transitions. [2022-12-13 15:30:59,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-12-13 15:30:59,954 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:30:59,954 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:30:59,960 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 15:31:00,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:31:00,155 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:31:00,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:31:00,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1363735611, now seen corresponding path program 1 times [2022-12-13 15:31:00,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:31:00,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601998539] [2022-12-13 15:31:00,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:31:00,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:31:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:00,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:31:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:00,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 15:31:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:00,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 15:31:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:00,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:31:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:00,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 15:31:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:00,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 15:31:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:00,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:31:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:00,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:31:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:00,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 15:31:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:00,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:31:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:00,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 15:31:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:00,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-12-13 15:31:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:00,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 15:31:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:00,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 15:31:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:00,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:31:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:00,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 15:31:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:00,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 15:31:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:00,390 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2022-12-13 15:31:00,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:31:00,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601998539] [2022-12-13 15:31:00,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601998539] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:31:00,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136964889] [2022-12-13 15:31:00,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:31:00,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:31:00,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:31:00,392 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:31:00,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 15:31:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:00,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 15:31:00,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:31:00,705 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-12-13 15:31:00,706 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:31:00,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136964889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:31:00,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:31:00,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 14 [2022-12-13 15:31:00,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120150489] [2022-12-13 15:31:00,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:31:00,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 15:31:00,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:31:00,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 15:31:00,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-12-13 15:31:00,708 INFO L87 Difference]: Start difference. First operand 532 states and 688 transitions. Second operand has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 5 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-12-13 15:31:01,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:31:01,112 INFO L93 Difference]: Finished difference Result 960 states and 1273 transitions. [2022-12-13 15:31:01,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 15:31:01,113 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 5 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 129 [2022-12-13 15:31:01,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:31:01,117 INFO L225 Difference]: With dead ends: 960 [2022-12-13 15:31:01,117 INFO L226 Difference]: Without dead ends: 550 [2022-12-13 15:31:01,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2022-12-13 15:31:01,120 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 182 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 15:31:01,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1159 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 15:31:01,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-12-13 15:31:01,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 533. [2022-12-13 15:31:01,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 373 states have (on average 1.2144772117962466) internal successors, (453), 379 states have internal predecessors, (453), 112 states have call successors, (112), 45 states have call predecessors, (112), 47 states have return successors, (122), 108 states have call predecessors, (122), 108 states have call successors, (122) [2022-12-13 15:31:01,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 687 transitions. [2022-12-13 15:31:01,188 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 687 transitions. Word has length 129 [2022-12-13 15:31:01,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:31:01,188 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 687 transitions. [2022-12-13 15:31:01,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 5 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-12-13 15:31:01,188 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 687 transitions. [2022-12-13 15:31:01,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-12-13 15:31:01,189 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:31:01,189 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:31:01,195 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 15:31:01,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 15:31:01,390 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:31:01,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:31:01,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1814934808, now seen corresponding path program 1 times [2022-12-13 15:31:01,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:31:01,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589216848] [2022-12-13 15:31:01,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:31:01,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:31:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:01,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:31:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:01,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 15:31:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:01,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 15:31:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:01,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:31:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:01,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 15:31:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:01,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 15:31:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:01,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:31:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:01,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:31:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:01,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 15:31:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:01,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:31:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:01,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 15:31:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:01,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 15:31:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:01,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 15:31:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:01,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 15:31:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:01,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:31:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:01,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-12-13 15:31:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:01,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 15:31:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:01,773 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-12-13 15:31:01,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:31:01,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589216848] [2022-12-13 15:31:01,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589216848] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:31:01,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641977809] [2022-12-13 15:31:01,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:31:01,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:31:01,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:31:01,775 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:31:01,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 15:31:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:01,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 67 conjunts are in the unsatisfiable core [2022-12-13 15:31:01,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:31:01,994 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 15:31:01,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 15:31:02,003 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 15:31:02,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 15:31:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 103 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-12-13 15:31:02,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:31:03,293 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-12-13 15:31:03,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641977809] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:31:03,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:31:03,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17, 13] total 33 [2022-12-13 15:31:03,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588887975] [2022-12-13 15:31:03,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:31:03,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-13 15:31:03,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:31:03,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-13 15:31:03,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2022-12-13 15:31:03,297 INFO L87 Difference]: Start difference. First operand 533 states and 687 transitions. Second operand has 33 states, 33 states have (on average 4.121212121212121) internal successors, (136), 31 states have internal predecessors, (136), 13 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (38), 13 states have call predecessors, (38), 13 states have call successors, (38) [2022-12-13 15:31:04,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:31:04,611 INFO L93 Difference]: Finished difference Result 1063 states and 1458 transitions. [2022-12-13 15:31:04,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 15:31:04,612 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.121212121212121) internal successors, (136), 31 states have internal predecessors, (136), 13 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (38), 13 states have call predecessors, (38), 13 states have call successors, (38) Word has length 131 [2022-12-13 15:31:04,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:31:04,614 INFO L225 Difference]: With dead ends: 1063 [2022-12-13 15:31:04,614 INFO L226 Difference]: Without dead ends: 650 [2022-12-13 15:31:04,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 270 SyntacticMatches, 10 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=218, Invalid=1422, Unknown=0, NotChecked=0, Total=1640 [2022-12-13 15:31:04,616 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 369 mSDsluCounter, 2528 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 2689 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:31:04,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 2689 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-13 15:31:04,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-12-13 15:31:04,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 551. [2022-12-13 15:31:04,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 385 states have (on average 1.2103896103896103) internal successors, (466), 391 states have internal predecessors, (466), 118 states have call successors, (118), 45 states have call predecessors, (118), 47 states have return successors, (128), 114 states have call predecessors, (128), 114 states have call successors, (128) [2022-12-13 15:31:04,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 712 transitions. [2022-12-13 15:31:04,659 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 712 transitions. Word has length 131 [2022-12-13 15:31:04,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:31:04,659 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 712 transitions. [2022-12-13 15:31:04,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.121212121212121) internal successors, (136), 31 states have internal predecessors, (136), 13 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (38), 13 states have call predecessors, (38), 13 states have call successors, (38) [2022-12-13 15:31:04,660 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 712 transitions. [2022-12-13 15:31:04,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-12-13 15:31:04,661 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:31:04,661 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:31:04,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 15:31:04,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 15:31:04,862 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:31:04,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:31:04,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1187163488, now seen corresponding path program 1 times [2022-12-13 15:31:04,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:31:04,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051985982] [2022-12-13 15:31:04,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:31:04,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:31:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:04,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:31:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:04,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 15:31:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:04,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 15:31:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:04,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:31:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:04,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 15:31:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:04,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 15:31:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:04,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:31:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:04,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:31:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:05,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 15:31:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:05,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:31:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:05,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 15:31:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:05,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 15:31:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:05,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-12-13 15:31:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:05,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-12-13 15:31:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:05,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:31:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:05,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-12-13 15:31:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:05,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 15:31:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:05,076 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2022-12-13 15:31:05,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:31:05,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051985982] [2022-12-13 15:31:05,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051985982] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:31:05,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935971175] [2022-12-13 15:31:05,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:31:05,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:31:05,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:31:05,078 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:31:05,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 15:31:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:05,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-13 15:31:05,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:31:05,291 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 15:31:05,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 15:31:05,301 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 15:31:05,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 15:31:06,143 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 110 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-12-13 15:31:06,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:31:06,572 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2022-12-13 15:31:06,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935971175] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:31:06,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:31:06,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 10] total 26 [2022-12-13 15:31:06,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047790285] [2022-12-13 15:31:06,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:31:06,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 15:31:06,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:31:06,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 15:31:06,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2022-12-13 15:31:06,576 INFO L87 Difference]: Start difference. First operand 551 states and 712 transitions. Second operand has 26 states, 25 states have (on average 5.36) internal successors, (134), 23 states have internal predecessors, (134), 12 states have call successors, (38), 4 states have call predecessors, (38), 8 states have return successors, (38), 12 states have call predecessors, (38), 12 states have call successors, (38) [2022-12-13 15:31:08,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:31:10,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:31:12,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:31:15,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:31:16,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:31:16,267 INFO L93 Difference]: Finished difference Result 1077 states and 1428 transitions. [2022-12-13 15:31:16,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-13 15:31:16,268 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 5.36) internal successors, (134), 23 states have internal predecessors, (134), 12 states have call successors, (38), 4 states have call predecessors, (38), 8 states have return successors, (38), 12 states have call predecessors, (38), 12 states have call successors, (38) Word has length 132 [2022-12-13 15:31:16,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:31:16,270 INFO L225 Difference]: With dead ends: 1077 [2022-12-13 15:31:16,270 INFO L226 Difference]: Without dead ends: 663 [2022-12-13 15:31:16,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 271 SyntacticMatches, 11 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=326, Invalid=2124, Unknown=0, NotChecked=0, Total=2450 [2022-12-13 15:31:16,272 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 252 mSDsluCounter, 1932 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 179 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 2105 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:31:16,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 2105 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1400 Invalid, 4 Unknown, 0 Unchecked, 9.1s Time] [2022-12-13 15:31:16,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2022-12-13 15:31:16,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 628. [2022-12-13 15:31:16,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 441 states have (on average 1.215419501133787) internal successors, (536), 451 states have internal predecessors, (536), 130 states have call successors, (130), 50 states have call predecessors, (130), 56 states have return successors, (147), 126 states have call predecessors, (147), 124 states have call successors, (147) [2022-12-13 15:31:16,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 813 transitions. [2022-12-13 15:31:16,323 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 813 transitions. Word has length 132 [2022-12-13 15:31:16,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:31:16,324 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 813 transitions. [2022-12-13 15:31:16,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 5.36) internal successors, (134), 23 states have internal predecessors, (134), 12 states have call successors, (38), 4 states have call predecessors, (38), 8 states have return successors, (38), 12 states have call predecessors, (38), 12 states have call successors, (38) [2022-12-13 15:31:16,324 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 813 transitions. [2022-12-13 15:31:16,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-12-13 15:31:16,325 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:31:16,326 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:31:16,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 15:31:16,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 15:31:16,527 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:31:16,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:31:16,527 INFO L85 PathProgramCache]: Analyzing trace with hash 800652698, now seen corresponding path program 1 times [2022-12-13 15:31:16,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:31:16,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464150567] [2022-12-13 15:31:16,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:31:16,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:31:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:16,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:31:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:16,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 15:31:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:16,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 15:31:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:16,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:31:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:16,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 15:31:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:16,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 15:31:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:16,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:31:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:16,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:31:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:16,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 15:31:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:16,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:31:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:16,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 15:31:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:16,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 15:31:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:16,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 15:31:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:16,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-12-13 15:31:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:16,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:31:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:16,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-12-13 15:31:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:16,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-12-13 15:31:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-12-13 15:31:16,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:31:16,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464150567] [2022-12-13 15:31:16,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464150567] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:31:16,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077325079] [2022-12-13 15:31:16,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:31:16,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:31:16,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:31:16,781 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:31:16,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 15:31:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:16,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 15:31:16,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:31:17,041 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-12-13 15:31:17,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:31:17,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077325079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:31:17,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:31:17,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2022-12-13 15:31:17,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559699292] [2022-12-13 15:31:17,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:31:17,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 15:31:17,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:31:17,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 15:31:17,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-13 15:31:17,043 INFO L87 Difference]: Start difference. First operand 628 states and 813 transitions. Second operand has 9 states, 8 states have (on average 9.25) internal successors, (74), 9 states have internal predecessors, (74), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2022-12-13 15:31:17,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:31:17,278 INFO L93 Difference]: Finished difference Result 1115 states and 1461 transitions. [2022-12-13 15:31:17,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 15:31:17,278 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.25) internal successors, (74), 9 states have internal predecessors, (74), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) Word has length 134 [2022-12-13 15:31:17,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:31:17,281 INFO L225 Difference]: With dead ends: 1115 [2022-12-13 15:31:17,281 INFO L226 Difference]: Without dead ends: 628 [2022-12-13 15:31:17,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-12-13 15:31:17,282 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 229 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:31:17,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 845 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:31:17,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2022-12-13 15:31:17,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2022-12-13 15:31:17,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 441 states have (on average 1.2086167800453516) internal successors, (533), 451 states have internal predecessors, (533), 130 states have call successors, (130), 50 states have call predecessors, (130), 56 states have return successors, (147), 126 states have call predecessors, (147), 124 states have call successors, (147) [2022-12-13 15:31:17,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 810 transitions. [2022-12-13 15:31:17,339 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 810 transitions. Word has length 134 [2022-12-13 15:31:17,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:31:17,339 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 810 transitions. [2022-12-13 15:31:17,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.25) internal successors, (74), 9 states have internal predecessors, (74), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2022-12-13 15:31:17,339 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 810 transitions. [2022-12-13 15:31:17,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-12-13 15:31:17,341 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:31:17,341 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:31:17,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 15:31:17,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 15:31:17,542 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:31:17,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:31:17,542 INFO L85 PathProgramCache]: Analyzing trace with hash 315027163, now seen corresponding path program 1 times [2022-12-13 15:31:17,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:31:17,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836170599] [2022-12-13 15:31:17,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:31:17,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:31:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:17,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:31:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:17,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 15:31:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:17,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 15:31:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:17,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:31:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:17,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 15:31:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:17,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 15:31:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:17,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:31:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:17,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:31:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:17,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 15:31:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:17,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:31:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:17,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 15:31:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:17,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 15:31:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:17,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:31:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:17,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 15:31:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:17,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 15:31:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:17,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:31:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:17,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-12-13 15:31:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:17,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-12-13 15:31:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:17,836 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-12-13 15:31:17,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:31:17,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836170599] [2022-12-13 15:31:17,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836170599] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:31:17,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323129585] [2022-12-13 15:31:17,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:31:17,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:31:17,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:31:17,838 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:31:17,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 15:31:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:18,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 15:31:18,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:31:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 121 proven. 3 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-12-13 15:31:18,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:31:18,254 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-12-13 15:31:18,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323129585] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:31:18,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:31:18,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 7] total 18 [2022-12-13 15:31:18,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605021228] [2022-12-13 15:31:18,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:31:18,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 15:31:18,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:31:18,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 15:31:18,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-12-13 15:31:18,256 INFO L87 Difference]: Start difference. First operand 628 states and 810 transitions. Second operand has 18 states, 15 states have (on average 5.6) internal successors, (84), 14 states have internal predecessors, (84), 5 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (25), 6 states have call predecessors, (25), 5 states have call successors, (25) [2022-12-13 15:31:18,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:31:18,553 INFO L93 Difference]: Finished difference Result 1161 states and 1524 transitions. [2022-12-13 15:31:18,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 15:31:18,554 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 5.6) internal successors, (84), 14 states have internal predecessors, (84), 5 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (25), 6 states have call predecessors, (25), 5 states have call successors, (25) Word has length 145 [2022-12-13 15:31:18,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:31:18,556 INFO L225 Difference]: With dead ends: 1161 [2022-12-13 15:31:18,556 INFO L226 Difference]: Without dead ends: 680 [2022-12-13 15:31:18,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2022-12-13 15:31:18,557 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 11 mSDsluCounter, 2110 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2281 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 15:31:18,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2281 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 15:31:18,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2022-12-13 15:31:18,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 633. [2022-12-13 15:31:18,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 445 states have (on average 1.2067415730337079) internal successors, (537), 456 states have internal predecessors, (537), 130 states have call successors, (130), 50 states have call predecessors, (130), 57 states have return successors, (151), 126 states have call predecessors, (151), 124 states have call successors, (151) [2022-12-13 15:31:18,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 818 transitions. [2022-12-13 15:31:18,609 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 818 transitions. Word has length 145 [2022-12-13 15:31:18,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:31:18,609 INFO L495 AbstractCegarLoop]: Abstraction has 633 states and 818 transitions. [2022-12-13 15:31:18,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 5.6) internal successors, (84), 14 states have internal predecessors, (84), 5 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (25), 6 states have call predecessors, (25), 5 states have call successors, (25) [2022-12-13 15:31:18,609 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 818 transitions. [2022-12-13 15:31:18,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-12-13 15:31:18,610 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:31:18,610 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 3, 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, 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] [2022-12-13 15:31:18,616 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 15:31:18,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 15:31:18,812 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:31:18,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:31:18,813 INFO L85 PathProgramCache]: Analyzing trace with hash 900691480, now seen corresponding path program 1 times [2022-12-13 15:31:18,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:31:18,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649334931] [2022-12-13 15:31:18,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:31:18,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:31:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:19,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:31:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:19,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 15:31:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:19,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 15:31:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:19,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:31:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:19,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 15:31:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:19,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 15:31:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:19,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:31:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:19,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:31:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:19,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 15:31:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:20,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:31:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:20,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 15:31:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:20,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 15:31:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:20,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:31:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:20,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-12-13 15:31:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:20,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 15:31:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:20,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:31:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:20,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-12-13 15:31:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:20,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-12-13 15:31:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:20,155 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 16 proven. 51 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-12-13 15:31:20,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:31:20,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649334931] [2022-12-13 15:31:20,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649334931] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:31:20,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245709768] [2022-12-13 15:31:20,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:31:20,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:31:20,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:31:20,157 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:31:20,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 15:31:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:20,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 90 conjunts are in the unsatisfiable core [2022-12-13 15:31:20,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:31:20,465 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 11 treesize of output 14 [2022-12-13 15:31:20,467 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-12-13 15:31:20,471 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-12-13 15:31:21,520 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 9 treesize of output 5 [2022-12-13 15:31:22,885 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 127 proven. 33 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-13 15:31:22,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:31:23,816 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:31:23,817 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 237 treesize of output 233 [2022-12-13 15:31:23,825 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:31:23,826 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 269 treesize of output 257 [2022-12-13 15:31:23,834 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:31:23,835 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 257 treesize of output 251 [2022-12-13 15:31:23,912 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:31:23,912 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 106 treesize of output 100 [2022-12-13 15:31:23,917 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:31:23,917 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 100 treesize of output 94 [2022-12-13 15:31:23,927 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:31:23,928 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 106 treesize of output 94 [2022-12-13 15:31:23,943 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 138 treesize of output 130 [2022-12-13 15:31:23,949 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-12-13 15:31:23,955 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-12-13 15:31:23,959 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-12-13 15:31:24,131 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 10 proven. 35 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-12-13 15:31:24,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245709768] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:31:24,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:31:24,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21, 18] total 51 [2022-12-13 15:31:24,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400086978] [2022-12-13 15:31:24,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:31:24,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-12-13 15:31:24,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:31:24,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-12-13 15:31:24,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2364, Unknown=0, NotChecked=0, Total=2550 [2022-12-13 15:31:24,136 INFO L87 Difference]: Start difference. First operand 633 states and 818 transitions. Second operand has 51 states, 49 states have (on average 3.938775510204082) internal successors, (193), 47 states have internal predecessors, (193), 22 states have call successors, (49), 4 states have call predecessors, (49), 10 states have return successors, (48), 21 states have call predecessors, (48), 22 states have call successors, (48) [2022-12-13 15:31:26,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:31:28,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:31:30,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:31:32,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:31:34,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:31:36,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:31:43,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:31:45,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:31:48,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:31:49,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:31:49,413 INFO L93 Difference]: Finished difference Result 1267 states and 1717 transitions. [2022-12-13 15:31:49,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-13 15:31:49,413 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 3.938775510204082) internal successors, (193), 47 states have internal predecessors, (193), 22 states have call successors, (49), 4 states have call predecessors, (49), 10 states have return successors, (48), 21 states have call predecessors, (48), 22 states have call successors, (48) Word has length 148 [2022-12-13 15:31:49,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:31:49,416 INFO L225 Difference]: With dead ends: 1267 [2022-12-13 15:31:49,416 INFO L226 Difference]: Without dead ends: 761 [2022-12-13 15:31:49,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 287 SyntacticMatches, 18 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2377 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=814, Invalid=7742, Unknown=0, NotChecked=0, Total=8556 [2022-12-13 15:31:49,418 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 617 mSDsluCounter, 4442 mSDsCounter, 0 mSdLazyCounter, 4899 mSolverCounterSat, 494 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 4652 SdHoareTripleChecker+Invalid, 5402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 494 IncrementalHoareTripleChecker+Valid, 4899 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.8s IncrementalHoareTripleChecker+Time [2022-12-13 15:31:49,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 4652 Invalid, 5402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [494 Valid, 4899 Invalid, 9 Unknown, 0 Unchecked, 22.8s Time] [2022-12-13 15:31:49,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2022-12-13 15:31:49,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 637. [2022-12-13 15:31:49,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 449 states have (on average 1.2048997772828507) internal successors, (541), 460 states have internal predecessors, (541), 130 states have call successors, (130), 50 states have call predecessors, (130), 57 states have return successors, (151), 126 states have call predecessors, (151), 124 states have call successors, (151) [2022-12-13 15:31:49,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 822 transitions. [2022-12-13 15:31:49,486 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 822 transitions. Word has length 148 [2022-12-13 15:31:49,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:31:49,487 INFO L495 AbstractCegarLoop]: Abstraction has 637 states and 822 transitions. [2022-12-13 15:31:49,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 3.938775510204082) internal successors, (193), 47 states have internal predecessors, (193), 22 states have call successors, (49), 4 states have call predecessors, (49), 10 states have return successors, (48), 21 states have call predecessors, (48), 22 states have call successors, (48) [2022-12-13 15:31:49,487 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 822 transitions. [2022-12-13 15:31:49,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-12-13 15:31:49,490 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:31:49,490 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 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, 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-12-13 15:31:49,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 15:31:49,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:31:49,691 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:31:49,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:31:49,691 INFO L85 PathProgramCache]: Analyzing trace with hash -438564955, now seen corresponding path program 1 times [2022-12-13 15:31:49,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:31:49,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279186892] [2022-12-13 15:31:49,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:31:49,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:31:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:49,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:31:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:49,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 15:31:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:49,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 15:31:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:49,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:31:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:49,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 15:31:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:49,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 15:31:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:49,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:31:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:49,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:31:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:50,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 15:31:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:50,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:31:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:50,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 15:31:50,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:50,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 15:31:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:50,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-12-13 15:31:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:50,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:31:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:50,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-12-13 15:31:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:50,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-12-13 15:31:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:50,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:31:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:50,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-12-13 15:31:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:50,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-12-13 15:31:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:50,238 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2022-12-13 15:31:50,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:31:50,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279186892] [2022-12-13 15:31:50,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279186892] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:31:50,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814825203] [2022-12-13 15:31:50,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:31:50,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:31:50,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:31:50,240 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:31:50,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 15:31:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:50,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 15:31:50,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:31:50,704 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-12-13 15:31:50,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:31:50,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814825203] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:31:50,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:31:50,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 13 [2022-12-13 15:31:50,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375862276] [2022-12-13 15:31:50,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:31:50,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 15:31:50,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:31:50,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 15:31:50,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-12-13 15:31:50,706 INFO L87 Difference]: Start difference. First operand 637 states and 822 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-12-13 15:31:51,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:31:51,840 INFO L93 Difference]: Finished difference Result 1311 states and 1788 transitions. [2022-12-13 15:31:51,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 15:31:51,841 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 158 [2022-12-13 15:31:51,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:31:51,844 INFO L225 Difference]: With dead ends: 1311 [2022-12-13 15:31:51,844 INFO L226 Difference]: Without dead ends: 806 [2022-12-13 15:31:51,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-12-13 15:31:51,845 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 34 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 15:31:51,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1221 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 15:31:51,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2022-12-13 15:31:51,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 668. [2022-12-13 15:31:51,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 475 states have (on average 1.2063157894736842) internal successors, (573), 488 states have internal predecessors, (573), 130 states have call successors, (130), 50 states have call predecessors, (130), 62 states have return successors, (167), 129 states have call predecessors, (167), 124 states have call successors, (167) [2022-12-13 15:31:51,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 870 transitions. [2022-12-13 15:31:51,917 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 870 transitions. Word has length 158 [2022-12-13 15:31:51,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:31:51,917 INFO L495 AbstractCegarLoop]: Abstraction has 668 states and 870 transitions. [2022-12-13 15:31:51,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-12-13 15:31:51,917 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 870 transitions. [2022-12-13 15:31:51,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-12-13 15:31:51,919 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:31:51,919 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 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, 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-12-13 15:31:51,926 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-13 15:31:52,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 15:31:52,121 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:31:52,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:31:52,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1128192995, now seen corresponding path program 1 times [2022-12-13 15:31:52,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:31:52,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922199626] [2022-12-13 15:31:52,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:31:52,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:31:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:52,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:31:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:52,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 15:31:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:52,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 15:31:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:52,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:31:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:52,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 15:31:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:52,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 15:31:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:52,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:31:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:52,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:31:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:52,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 15:31:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:52,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:31:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:52,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 15:31:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:52,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 15:31:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:52,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-12-13 15:31:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:52,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:31:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:52,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-12-13 15:31:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:52,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-12-13 15:31:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:52,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:31:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:52,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-12-13 15:31:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:52,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-12-13 15:31:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2022-12-13 15:31:52,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:31:52,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922199626] [2022-12-13 15:31:52,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922199626] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:31:52,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649096552] [2022-12-13 15:31:52,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:31:52,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:31:52,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:31:52,449 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:31:52,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 15:31:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:31:52,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 89 conjunts are in the unsatisfiable core [2022-12-13 15:31:52,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:31:52,692 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 15:31:52,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 15:31:52,703 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 15:31:52,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 15:31:54,848 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| Int)) (not (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| Int)) (not (= (+ |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| 16) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|))))) is different from true [2022-12-13 15:31:56,949 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_44| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_44|) 0) 16))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_44| Int)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_44| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_44|) 0))))) is different from true [2022-12-13 15:31:59,036 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_42| Int)) (not (= 16 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_42|) 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_42| Int)) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_42| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_42|) 0))))) is different from true [2022-12-13 15:32:09,104 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-12-13 15:32:23,206 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-12-13 15:32:33,281 WARN L233 SmtUtils]: Spent 8.02s 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-12-13 15:32:41,365 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-12-13 15:32:51,498 WARN L233 SmtUtils]: Spent 8.02s 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-12-13 15:32:59,579 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-12-13 15:32:59,602 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 154 proven. 20 refuted. 0 times theorem prover too weak. 57 trivial. 7 not checked. [2022-12-13 15:32:59,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:33:02,476 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 4 proven. 51 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-12-13 15:33:02,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649096552] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:33:02,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:33:02,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 21, 14] total 38 [2022-12-13 15:33:02,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471710288] [2022-12-13 15:33:02,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:33:02,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-13 15:33:02,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:33:02,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-13 15:33:02,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1066, Unknown=10, NotChecked=204, Total=1406 [2022-12-13 15:33:02,479 INFO L87 Difference]: Start difference. First operand 668 states and 870 transitions. Second operand has 38 states, 35 states have (on average 4.942857142857143) internal successors, (173), 35 states have internal predecessors, (173), 16 states have call successors, (39), 5 states have call predecessors, (39), 10 states have return successors, (39), 14 states have call predecessors, (39), 16 states have call successors, (39) [2022-12-13 15:33:04,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:33:06,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:33:08,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:33:10,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:33:12,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:33:14,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:33:16,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:33:18,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:33:20,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:33:22,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:33:28,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:33:30,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:33:32,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:33:40,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-12-13 15:33:42,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:33:44,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-12-13 15:33:47,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:33:49,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-12-13 15:33:51,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:33:53,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:33:55,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:33:57,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:33:59,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:34:05,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:34:07,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:34:13,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:34:15,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:34:31,597 WARN L233 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:34:41,657 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:35:01,805 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:35:09,862 WARN L233 SmtUtils]: Spent 8.03s 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-12-13 15:35:17,965 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-12-13 15:35:26,014 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:35:34,072 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:35:36,104 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| Int)) (not (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| Int)) (not (= (+ |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| 16) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_42| Int)) (not (= 16 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_42|) 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_42| Int)) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_42| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_42|) 0)))))) is different from true [2022-12-13 15:35:44,216 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:35:52,281 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:36:00,351 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:36:08,458 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:36:16,523 WARN L233 SmtUtils]: Spent 8.03s 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-12-13 15:36:24,596 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:36:40,715 WARN L233 SmtUtils]: Spent 16.07s on a formula simplification. DAG size of input: 48 DAG size of output: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:36:48,785 WARN L233 SmtUtils]: Spent 8.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-12-13 15:36:56,873 WARN L233 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:37:13,112 WARN L233 SmtUtils]: Spent 16.09s on a formula simplification. DAG size of input: 50 DAG size of output: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:37:29,237 WARN L233 SmtUtils]: Spent 16.08s on a formula simplification. DAG size of input: 52 DAG size of output: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:37:31,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:37:39,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:37:41,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:37:43,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:37:45,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:37:47,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-12-13 15:37:49,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:37:51,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:37:53,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:37:55,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:37:57,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:37:59,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:38:01,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:38:15,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:38:17,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:38:19,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:38:39,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:38:41,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:38:43,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:38:45,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:38:47,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:38:49,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:38:51,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:38:53,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:38:55,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:38:57,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:39:01,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:39:03,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:39:05,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:39:07,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:39:17,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:39:19,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:39:28,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:39:30,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:39:34,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:39:36,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:39:44,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:39:46,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:39:48,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:39:50,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:39:52,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-12-13 15:39:54,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:39:56,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:39:58,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:40:04,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:40:06,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:40:12,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:40:14,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:40:16,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:40:18,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:40:26,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:40:28,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:40:30,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:40:32,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:40:34,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:40:36,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:40:38,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:40:40,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:40:42,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 15:40:43,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:40:43,311 INFO L93 Difference]: Finished difference Result 1537 states and 2076 transitions. [2022-12-13 15:40:43,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-12-13 15:40:43,312 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 4.942857142857143) internal successors, (173), 35 states have internal predecessors, (173), 16 states have call successors, (39), 5 states have call predecessors, (39), 10 states have return successors, (39), 14 states have call predecessors, (39), 16 states have call successors, (39) Word has length 158 [2022-12-13 15:40:43,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:40:43,315 INFO L225 Difference]: With dead ends: 1537 [2022-12-13 15:40:43,315 INFO L226 Difference]: Without dead ends: 969 [2022-12-13 15:40:43,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 328 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 355.3s TimeCoverageRelationStatistics Valid=932, Invalid=5496, Unknown=68, NotChecked=644, Total=7140 [2022-12-13 15:40:43,317 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 324 mSDsluCounter, 2873 mSDsCounter, 0 mSdLazyCounter, 2390 mSolverCounterSat, 158 mSolverCounterUnsat, 86 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 174.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 3062 SdHoareTripleChecker+Invalid, 3510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 2390 IncrementalHoareTripleChecker+Invalid, 86 IncrementalHoareTripleChecker+Unknown, 876 IncrementalHoareTripleChecker+Unchecked, 174.3s IncrementalHoareTripleChecker+Time [2022-12-13 15:40:43,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 3062 Invalid, 3510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 2390 Invalid, 86 Unknown, 876 Unchecked, 174.3s Time] [2022-12-13 15:40:43,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2022-12-13 15:40:43,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 780. [2022-12-13 15:40:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 574 states have (on average 1.2055749128919862) internal successors, (692), 582 states have internal predecessors, (692), 136 states have call successors, (136), 61 states have call predecessors, (136), 69 states have return successors, (175), 136 states have call predecessors, (175), 130 states have call successors, (175) [2022-12-13 15:40:43,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1003 transitions. [2022-12-13 15:40:43,464 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1003 transitions. Word has length 158 [2022-12-13 15:40:43,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:40:43,464 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 1003 transitions. [2022-12-13 15:40:43,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 4.942857142857143) internal successors, (173), 35 states have internal predecessors, (173), 16 states have call successors, (39), 5 states have call predecessors, (39), 10 states have return successors, (39), 14 states have call predecessors, (39), 16 states have call successors, (39) [2022-12-13 15:40:43,465 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1003 transitions. [2022-12-13 15:40:43,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-12-13 15:40:43,466 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:40:43,467 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:40:43,472 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 15:40:43,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 15:40:43,668 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:40:43,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:40:43,668 INFO L85 PathProgramCache]: Analyzing trace with hash 611292156, now seen corresponding path program 2 times [2022-12-13 15:40:43,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:40:43,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572273465] [2022-12-13 15:40:43,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:40:43,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:40:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:44,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:40:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:44,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 15:40:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:44,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 15:40:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:44,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:40:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:44,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 15:40:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:44,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 15:40:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:44,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:40:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:44,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:40:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:44,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 15:40:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:44,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:40:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:44,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 15:40:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:44,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-12-13 15:40:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:44,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 15:40:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:44,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:40:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:44,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 15:40:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:44,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-12-13 15:40:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:44,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-12-13 15:40:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:44,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:40:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:44,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-12-13 15:40:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:44,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-12-13 15:40:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:40:44,442 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2022-12-13 15:40:44,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:40:44,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572273465] [2022-12-13 15:40:44,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572273465] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:40:44,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080817435] [2022-12-13 15:40:44,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 15:40:44,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:40:44,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:40:44,443 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:40:44,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 15:40:44,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 15:40:44,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:40:44,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 89 conjunts are in the unsatisfiable core [2022-12-13 15:40:44,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:40:44,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:40:44,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-12-13 15:40:44,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:40:44,712 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 16 treesize of output 17 [2022-12-13 15:41:09,512 WARN L233 SmtUtils]: Spent 10.02s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:41:09,757 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 15:41:09,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 22 [2022-12-13 15:41:09,763 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-13 15:41:09,763 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 25 treesize of output 1 [2022-12-13 15:41:09,767 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 189 proven. 8 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-12-13 15:41:09,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:41:10,231 INFO L321 Elim1Store]: treesize reduction 17, result has 63.0 percent of original size [2022-12-13 15:41:10,231 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 2 case distinctions, treesize of input 94 treesize of output 98 [2022-12-13 15:41:10,243 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:41:10,243 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 98 treesize of output 114 [2022-12-13 15:41:10,249 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 33 treesize of output 31 [2022-12-13 15:41:10,291 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-12-13 15:41:10,306 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 5 [2022-12-13 15:41:10,314 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:41:10,315 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 25 treesize of output 29 [2022-12-13 15:41:10,347 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:41:10,347 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 59 treesize of output 61 [2022-12-13 15:41:10,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:41:10,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:41:10,373 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 15:41:10,374 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 20 treesize of output 1 [2022-12-13 15:41:10,434 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-12-13 15:41:10,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080817435] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:41:10,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:41:10,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 11] total 37 [2022-12-13 15:41:10,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514463976] [2022-12-13 15:41:10,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:41:10,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-13 15:41:10,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:41:10,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-13 15:41:10,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1202, Unknown=7, NotChecked=0, Total=1332 [2022-12-13 15:41:10,436 INFO L87 Difference]: Start difference. First operand 780 states and 1003 transitions. Second operand has 37 states, 36 states have (on average 5.333333333333333) internal successors, (192), 36 states have internal predecessors, (192), 21 states have call successors, (49), 4 states have call predecessors, (49), 8 states have return successors, (48), 20 states have call predecessors, (48), 21 states have call successors, (48) [2022-12-13 15:41:30,674 WARN L233 SmtUtils]: Spent 20.07s on a formula simplification. DAG size of input: 46 DAG size of output: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:41:51,601 WARN L233 SmtUtils]: Spent 20.06s on a formula simplification. DAG size of input: 55 DAG size of output: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:42:01,951 WARN L233 SmtUtils]: Spent 10.02s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:42:12,061 WARN L233 SmtUtils]: Spent 10.02s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:42:22,122 WARN L233 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:42:32,249 WARN L233 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:42:33,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:42:33,695 INFO L93 Difference]: Finished difference Result 1444 states and 2018 transitions. [2022-12-13 15:42:33,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 15:42:33,696 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 5.333333333333333) internal successors, (192), 36 states have internal predecessors, (192), 21 states have call successors, (49), 4 states have call predecessors, (49), 8 states have return successors, (48), 20 states have call predecessors, (48), 21 states have call successors, (48) Word has length 169 [2022-12-13 15:42:33,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:42:33,698 INFO L225 Difference]: With dead ends: 1444 [2022-12-13 15:42:33,698 INFO L226 Difference]: Without dead ends: 792 [2022-12-13 15:42:33,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 357 SyntacticMatches, 9 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 105.9s TimeCoverageRelationStatistics Valid=414, Invalid=2885, Unknown=7, NotChecked=0, Total=3306 [2022-12-13 15:42:33,700 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 277 mSDsluCounter, 4027 mSDsCounter, 0 mSdLazyCounter, 3536 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 4242 SdHoareTripleChecker+Invalid, 3699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 3536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-12-13 15:42:33,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 4242 Invalid, 3699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 3536 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-12-13 15:42:33,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2022-12-13 15:42:33,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 641. [2022-12-13 15:42:33,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 459 states have (on average 1.2222222222222223) internal successors, (561), 469 states have internal predecessors, (561), 123 states have call successors, (123), 45 states have call predecessors, (123), 58 states have return successors, (183), 126 states have call predecessors, (183), 117 states have call successors, (183) [2022-12-13 15:42:33,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 867 transitions. [2022-12-13 15:42:33,793 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 867 transitions. Word has length 169 [2022-12-13 15:42:33,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:42:33,793 INFO L495 AbstractCegarLoop]: Abstraction has 641 states and 867 transitions. [2022-12-13 15:42:33,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 5.333333333333333) internal successors, (192), 36 states have internal predecessors, (192), 21 states have call successors, (49), 4 states have call predecessors, (49), 8 states have return successors, (48), 20 states have call predecessors, (48), 21 states have call successors, (48) [2022-12-13 15:42:33,794 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 867 transitions. [2022-12-13 15:42:33,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-12-13 15:42:33,796 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:42:33,796 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:42:33,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-13 15:42:33,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 15:42:33,998 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:42:33,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:33,999 INFO L85 PathProgramCache]: Analyzing trace with hash -2093531135, now seen corresponding path program 1 times [2022-12-13 15:42:33,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:42:34,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774457806] [2022-12-13 15:42:34,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:42:34,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:42:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:34,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 15:42:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:34,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 15:42:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:34,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 15:42:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:34,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:42:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:34,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-12-13 15:42:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:34,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-12-13 15:42:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:34,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:42:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:34,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 15:42:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:34,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-12-13 15:42:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:34,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:42:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:34,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 15:42:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:34,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 15:42:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:34,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-12-13 15:42:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:34,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-12-13 15:42:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:34,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:42:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:34,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 15:42:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:34,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 15:42:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:34,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-12-13 15:42:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:34,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 15:42:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:34,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-12-13 15:42:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:34,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-12-13 15:42:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:34,350 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 54 proven. 8 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2022-12-13 15:42:34,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:42:34,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774457806] [2022-12-13 15:42:34,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774457806] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:42:34,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65723922] [2022-12-13 15:42:34,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:42:34,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:42:34,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:42:34,351 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:42:34,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a0ede3-c856-41dc-9118-f597630f17fe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 15:42:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:34,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 145 conjunts are in the unsatisfiable core [2022-12-13 15:42:34,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:42:34,581 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 6 treesize of output 5 [2022-12-13 15:42:34,768 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 15:42:34,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 15:42:34,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-13 15:42:34,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 15:42:34,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-13 15:42:34,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 15:42:34,845 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 15:42:34,852 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 15:42:34,852 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 46 [2022-12-13 15:42:34,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:42:34,865 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 15:42:34,866 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 54 [2022-12-13 15:42:34,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:42:34,881 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-13 15:42:34,881 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 1 case distinctions, treesize of input 36 treesize of output 46 [2022-12-13 15:42:34,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:42:34,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:42:34,899 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 15:42:34,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2022-12-13 15:42:35,018 INFO L321 Elim1Store]: treesize reduction 117, result has 14.6 percent of original size [2022-12-13 15:42:35,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 223 treesize of output 219 [2022-12-13 15:42:35,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:42:35,024 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 261 treesize of output 233 [2022-12-13 15:42:35,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:42:35,044 INFO L321 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2022-12-13 15:42:35,044 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 2 case distinctions, treesize of input 284 treesize of output 191 [2022-12-13 15:42:35,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-12-13 15:42:35,066 INFO L321 Elim1Store]: treesize reduction 76, result has 10.6 percent of original size [2022-12-13 15:42:35,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 152 treesize of output 69 [2022-12-13 15:42:35,074 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-12-13 15:42:37,398 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 131 proven. 45 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-12-13 15:42:37,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:42:37,872 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_1568 (Array Int Int)) (v_ArrVal_1572 Int) (v_ArrVal_1566 (Array Int Int)) (v_ArrVal_1573 Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1568) |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_1566) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_1573)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset|))) (select (select (let ((.cse2 (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 .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_1572))) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset|))) 0))) is different from false [2022-12-13 15:42:37,893 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:42:37,893 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 112 treesize of output 111 [2022-12-13 15:42:38,026 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:42:38,027 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 142 treesize of output 119 [2022-12-13 15:42:38,515 INFO L321 Elim1Store]: treesize reduction 130, result has 73.0 percent of original size [2022-12-13 15:42:38,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 152762 treesize of output 132749 [2022-12-13 15:42:39,408 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:42:39,409 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 132362 treesize of output 125523 [2022-12-13 15:42:39,889 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:42:39,891 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 938751 treesize of output 916517 [2022-12-13 15:42:43,394 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:42:43,404 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 1031183 treesize of output 1000373 [2022-12-13 15:42:50,507 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 1057702 treesize of output 1042294 [2022-12-13 15:42:54,993 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:42:54,996 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 1384369 treesize of output 1363438 [2022-12-13 15:43:32,758 WARN L233 SmtUtils]: Spent 37.76s on a formula simplification. DAG size of input: 2248 DAG size of output: 2248 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 15:43:33,616 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:43:33,619 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 1491920 treesize of output 1466329 [2022-12-13 15:43:43,998 WARN L233 SmtUtils]: Spent 10.37s on a formula simplification. DAG size of input: 2345 DAG size of output: 2344 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 15:43:44,529 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:43:44,531 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 1465874 treesize of output 1462805 [2022-12-13 15:43:49,807 WARN L233 SmtUtils]: Spent 5.27s on a formula simplification that was a NOOP. DAG size: 2388 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-13 15:44:00,199 WARN L233 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 2039 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)