./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_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_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/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_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/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_72b7a40a-3920-4c11-80de-6d89f3765b3e/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 bd5e922bebe187c1230ec455171e0dbeb52eef7c95cec8ebc1ad02d91040db3c --- 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 21:25:48,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:25:48,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:25:48,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:25:48,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:25:48,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:25:48,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:25:48,240 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:25:48,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:25:48,243 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:25:48,244 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:25:48,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:25:48,245 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:25:48,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:25:48,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:25:48,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:25:48,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:25:48,250 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:25:48,252 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:25:48,254 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:25:48,255 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:25:48,256 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:25:48,257 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:25:48,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:25:48,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:25:48,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:25:48,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:25:48,261 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:25:48,261 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:25:48,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:25:48,262 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:25:48,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:25:48,263 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:25:48,264 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:25:48,265 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:25:48,265 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:25:48,265 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:25:48,266 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:25:48,266 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:25:48,266 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:25:48,267 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:25:48,268 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-12-13 21:25:48,282 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:25:48,283 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:25:48,283 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:25:48,283 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:25:48,284 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:25:48,284 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:25:48,284 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:25:48,284 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:25:48,284 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:25:48,285 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:25:48,285 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 21:25:48,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:25:48,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 21:25:48,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:25:48,285 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 21:25:48,286 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 21:25:48,286 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:25:48,286 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 21:25:48,286 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:25:48,286 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:25:48,286 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:25:48,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:25:48,287 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:25:48,287 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:25:48,287 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 21:25:48,287 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 21:25:48,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 21:25:48,288 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:25:48,288 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 21:25:48,288 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:25:48,288 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:25:48,288 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:25:48,288 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_72b7a40a-3920-4c11-80de-6d89f3765b3e/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_72b7a40a-3920-4c11-80de-6d89f3765b3e/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 -> bd5e922bebe187c1230ec455171e0dbeb52eef7c95cec8ebc1ad02d91040db3c [2022-12-13 21:25:48,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:25:48,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:25:48,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:25:48,499 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:25:48,499 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:25:48,500 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i [2022-12-13 21:25:51,058 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:25:51,356 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:25:51,356 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i [2022-12-13 21:25:51,376 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/data/0c2620177/7a1d71b3f08e40288fc673978ca7afe9/FLAGcef128e6d [2022-12-13 21:25:51,387 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/data/0c2620177/7a1d71b3f08e40288fc673978ca7afe9 [2022-12-13 21:25:51,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:25:51,390 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:25:51,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:25:51,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:25:51,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:25:51,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:25:51" (1/1) ... [2022-12-13 21:25:51,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a806a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:25:51, skipping insertion in model container [2022-12-13 21:25:51,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:25:51" (1/1) ... [2022-12-13 21:25:51,402 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:25:51,479 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:25:51,679 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_72b7a40a-3920-4c11-80de-6d89f3765b3e/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4497,4510] [2022-12-13 21:25:51,685 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4557,4570] [2022-12-13 21:25:52,238 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:25:52,239 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:25:52,239 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:25:52,240 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:25:52,241 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:25:52,255 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:25:52,256 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:25:52,257 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:25:52,258 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:25:52,322 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 21:25:52,323 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 21:25:52,324 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 21:25:52,328 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-12-13 21:25:52,331 WARN L623 FunctionHandler]: Unknown extern function htons [2022-12-13 21:25:52,331 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-12-13 21:25:52,547 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-12-13 21:25:52,548 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-12-13 21:25:52,549 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-12-13 21:25:52,549 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-12-13 21:25:52,550 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-12-13 21:25:52,551 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-12-13 21:25:52,551 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-12-13 21:25:52,552 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-12-13 21:25:52,552 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-12-13 21:25:52,552 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-12-13 21:25:52,553 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-12-13 21:25:52,668 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-12-13 21:25:52,694 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-12-13 21:25:52,702 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 21:25:52,722 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 21:25:52,728 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:25:52,728 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:25:52,765 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-12-13 21:25:52,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:25:52,812 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:25:52,822 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_72b7a40a-3920-4c11-80de-6d89f3765b3e/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4497,4510] [2022-12-13 21:25:52,822 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_72b7a40a-3920-4c11-80de-6d89f3765b3e/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4557,4570] [2022-12-13 21:25:52,844 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:25:52,845 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:25:52,845 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:25:52,845 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:25:52,846 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:25:52,850 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:25:52,850 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:25:52,851 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:25:52,851 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:25:52,855 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 21:25:52,856 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 21:25:52,856 WARN L623 FunctionHandler]: Unknown extern function htonl [2022-12-13 21:25:52,858 WARN L623 FunctionHandler]: Unknown extern function ntohl [2022-12-13 21:25:52,859 WARN L623 FunctionHandler]: Unknown extern function htons [2022-12-13 21:25:52,859 WARN L623 FunctionHandler]: Unknown extern function ntohs [2022-12-13 21:25:52,873 WARN L623 FunctionHandler]: Unknown extern function my_abort [2022-12-13 21:25:52,873 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-12-13 21:25:52,874 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-12-13 21:25:52,874 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-12-13 21:25:52,875 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-12-13 21:25:52,875 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-12-13 21:25:52,876 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-12-13 21:25:52,876 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-12-13 21:25:52,876 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-12-13 21:25:52,877 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-12-13 21:25:52,877 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-12-13 21:25:52,891 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-12-13 21:25:52,905 WARN L623 FunctionHandler]: Unknown extern function memchr [2022-12-13 21:25:52,909 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 21:25:52,921 WARN L623 FunctionHandler]: Unknown extern function memcmp [2022-12-13 21:25:52,926 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:25:52,926 WARN L1576 CHandler]: Possible shadowing of function index [2022-12-13 21:25:52,943 WARN L623 FunctionHandler]: Unknown extern function fprintf [2022-12-13 21:25:52,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:25:53,117 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:25:53,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:25:53 WrapperNode [2022-12-13 21:25:53,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:25:53,118 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:25:53,118 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:25:53,118 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:25:53,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:25:53" (1/1) ... [2022-12-13 21:25:53,176 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:25:53" (1/1) ... [2022-12-13 21:25:53,216 INFO L138 Inliner]: procedures = 690, calls = 2614, calls flagged for inlining = 57, calls inlined = 4, statements flattened = 765 [2022-12-13 21:25:53,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:25:53,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:25:53,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:25:53,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:25:53,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:25:53" (1/1) ... [2022-12-13 21:25:53,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:25:53" (1/1) ... [2022-12-13 21:25:53,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:25:53" (1/1) ... [2022-12-13 21:25:53,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:25:53" (1/1) ... [2022-12-13 21:25:53,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:25:53" (1/1) ... [2022-12-13 21:25:53,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:25:53" (1/1) ... [2022-12-13 21:25:53,269 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:25:53" (1/1) ... [2022-12-13 21:25:53,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:25:53" (1/1) ... [2022-12-13 21:25:53,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:25:53,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:25:53,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:25:53,283 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:25:53,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:25:53" (1/1) ... [2022-12-13 21:25:53,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:25:53,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:25:53,310 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:25:53,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:25:53,345 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-12-13 21:25:53,345 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-12-13 21:25:53,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 21:25:53,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 21:25:53,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-13 21:25:53,345 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-13 21:25:53,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 21:25:53,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:25:53,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 21:25:53,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:25:53,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:25:53,346 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-12-13 21:25:53,346 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-12-13 21:25:53,346 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 21:25:53,346 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 21:25:53,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 21:25:53,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 21:25:53,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 21:25:53,346 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-12-13 21:25:53,346 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-12-13 21:25:53,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 21:25:53,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 21:25:53,346 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_from_array [2022-12-13 21:25:53,347 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_from_array [2022-12-13 21:25:53,520 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:25:53,522 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:25:54,237 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:25:54,243 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:25:54,243 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 21:25:54,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:25:54 BoogieIcfgContainer [2022-12-13 21:25:54,245 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:25:54,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:25:54,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:25:54,250 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:25:54,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:25:51" (1/3) ... [2022-12-13 21:25:54,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69caa016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:25:54, skipping insertion in model container [2022-12-13 21:25:54,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:25:53" (2/3) ... [2022-12-13 21:25:54,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69caa016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:25:54, skipping insertion in model container [2022-12-13 21:25:54,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:25:54" (3/3) ... [2022-12-13 21:25:54,253 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_array_harness.i [2022-12-13 21:25:54,268 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:25:54,268 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 21:25:54,302 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:25:54,307 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;@7dd0a060, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:25:54,307 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 21:25:54,310 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-12-13 21:25:54,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 21:25:54,315 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:25:54,316 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 21:25:54,316 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:25:54,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:25:54,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2742655, now seen corresponding path program 1 times [2022-12-13 21:25:54,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:25:54,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929250918] [2022-12-13 21:25:54,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:25:54,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:25:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:25:54,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:25:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:25:54,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:25:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:25:54,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 21:25:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:25:54,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:25:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:25:54,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:25:54,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:25:54,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929250918] [2022-12-13 21:25:54,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929250918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:25:54,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:25:54,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:25:54,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650998116] [2022-12-13 21:25:54,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:25:54,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:25:54,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:25:54,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:25:54,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:25:54,798 INFO L87 Difference]: Start difference. First operand has 73 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 21:25:54,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:25:54,981 INFO L93 Difference]: Finished difference Result 141 states and 189 transitions. [2022-12-13 21:25:54,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:25:54,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-12-13 21:25:54,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:25:54,990 INFO L225 Difference]: With dead ends: 141 [2022-12-13 21:25:54,990 INFO L226 Difference]: Without dead ends: 66 [2022-12-13 21:25:54,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:25:54,995 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 35 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:25:54,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 74 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:25:55,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-12-13 21:25:55,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-12-13 21:25:55,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 45 states have internal predecessors, (52), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-12-13 21:25:55,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2022-12-13 21:25:55,026 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 31 [2022-12-13 21:25:55,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:25:55,027 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2022-12-13 21:25:55,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 21:25:55,027 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2022-12-13 21:25:55,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 21:25:55,028 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:25:55,028 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 21:25:55,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 21:25:55,029 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:25:55,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:25:55,029 INFO L85 PathProgramCache]: Analyzing trace with hash -873311295, now seen corresponding path program 1 times [2022-12-13 21:25:55,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:25:55,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049642102] [2022-12-13 21:25:55,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:25:55,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:25:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:25:55,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:25:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:25:55,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:25:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:25:55,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 21:25:55,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:25:55,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:25:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:25:55,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:25:55,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:25:55,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049642102] [2022-12-13 21:25:55,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049642102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:25:55,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:25:55,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:25:55,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82028641] [2022-12-13 21:25:55,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:25:55,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:25:55,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:25:55,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:25:55,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:25:55,476 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 21:25:55,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:25:55,698 INFO L93 Difference]: Finished difference Result 121 states and 149 transitions. [2022-12-13 21:25:55,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:25:55,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-12-13 21:25:55,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:25:55,701 INFO L225 Difference]: With dead ends: 121 [2022-12-13 21:25:55,701 INFO L226 Difference]: Without dead ends: 69 [2022-12-13 21:25:55,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:25:55,703 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 55 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:25:55,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 119 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:25:55,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-12-13 21:25:55,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-12-13 21:25:55,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.173913043478261) internal successors, (54), 48 states have internal predecessors, (54), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-12-13 21:25:55,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2022-12-13 21:25:55,710 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 31 [2022-12-13 21:25:55,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:25:55,710 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2022-12-13 21:25:55,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 21:25:55,711 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-12-13 21:25:55,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 21:25:55,711 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:25:55,711 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 21:25:55,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 21:25:55,712 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:25:55,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:25:55,712 INFO L85 PathProgramCache]: Analyzing trace with hash 355281356, now seen corresponding path program 1 times [2022-12-13 21:25:55,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:25:55,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123349337] [2022-12-13 21:25:55,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:25:55,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:25:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:25:56,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:25:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:25:56,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:25:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:25:56,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 21:25:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:25:56,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:25:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:25:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:25:56,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:25:56,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123349337] [2022-12-13 21:25:56,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123349337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:25:56,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:25:56,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 21:25:56,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412741712] [2022-12-13 21:25:56,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:25:56,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 21:25:56,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:25:56,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 21:25:56,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:25:56,352 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:25:56,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:25:56,679 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2022-12-13 21:25:56,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 21:25:56,679 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-12-13 21:25:56,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:25:56,681 INFO L225 Difference]: With dead ends: 81 [2022-12-13 21:25:56,681 INFO L226 Difference]: Without dead ends: 79 [2022-12-13 21:25:56,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-12-13 21:25:56,682 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 62 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:25:56,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 250 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 21:25:56,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-12-13 21:25:56,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2022-12-13 21:25:56,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 55 states have internal predecessors, (60), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2022-12-13 21:25:56,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2022-12-13 21:25:56,692 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 37 [2022-12-13 21:25:56,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:25:56,692 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2022-12-13 21:25:56,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:25:56,692 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2022-12-13 21:25:56,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 21:25:56,693 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:25:56,693 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:25:56,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 21:25:56,694 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:25:56,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:25:56,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1397933292, now seen corresponding path program 1 times [2022-12-13 21:25:56,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:25:56,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122856563] [2022-12-13 21:25:56,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:25:56,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:25:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:25:57,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:25:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:25:57,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:25:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:25:57,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 21:25:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:25:57,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:25:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:25:57,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:25:57,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:25:57,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122856563] [2022-12-13 21:25:57,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122856563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:25:57,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:25:57,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:25:57,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091470513] [2022-12-13 21:25:57,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:25:57,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:25:57,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:25:57,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:25:57,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:25:57,295 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:25:57,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:25:57,592 INFO L93 Difference]: Finished difference Result 162 states and 201 transitions. [2022-12-13 21:25:57,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:25:57,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2022-12-13 21:25:57,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:25:57,593 INFO L225 Difference]: With dead ends: 162 [2022-12-13 21:25:57,593 INFO L226 Difference]: Without dead ends: 103 [2022-12-13 21:25:57,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-12-13 21:25:57,594 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 112 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:25:57,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 120 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:25:57,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-12-13 21:25:57,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 83. [2022-12-13 21:25:57,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 60 states have internal predecessors, (67), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2022-12-13 21:25:57,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2022-12-13 21:25:57,601 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 41 [2022-12-13 21:25:57,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:25:57,601 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2022-12-13 21:25:57,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:25:57,601 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2022-12-13 21:25:57,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 21:25:57,602 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:25:57,602 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:25:57,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 21:25:57,602 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:25:57,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:25:57,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1139767854, now seen corresponding path program 1 times [2022-12-13 21:25:57,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:25:57,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863650595] [2022-12-13 21:25:57,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:25:57,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:25:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:25:59,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:25:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:25:59,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:25:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:25:59,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 21:25:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:25:59,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:25:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:00,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:26:00,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:26:00,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863650595] [2022-12-13 21:26:00,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863650595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:26:00,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:26:00,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 21:26:00,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360603806] [2022-12-13 21:26:00,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:26:00,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 21:26:00,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:26:00,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 21:26:00,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 21:26:00,015 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 21:26:00,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:26:00,754 INFO L93 Difference]: Finished difference Result 166 states and 205 transitions. [2022-12-13 21:26:00,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 21:26:00,754 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-12-13 21:26:00,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:26:00,755 INFO L225 Difference]: With dead ends: 166 [2022-12-13 21:26:00,755 INFO L226 Difference]: Without dead ends: 102 [2022-12-13 21:26:00,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-12-13 21:26:00,756 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 147 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 21:26:00,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 223 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 21:26:00,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-12-13 21:26:00,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 95. [2022-12-13 21:26:00,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 72 states have internal predecessors, (84), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2022-12-13 21:26:00,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 118 transitions. [2022-12-13 21:26:00,767 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 118 transitions. Word has length 41 [2022-12-13 21:26:00,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:26:00,767 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 118 transitions. [2022-12-13 21:26:00,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 21:26:00,767 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 118 transitions. [2022-12-13 21:26:00,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 21:26:00,768 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:26:00,768 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:26:00,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 21:26:00,769 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:26:00,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:26:00,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1875335764, now seen corresponding path program 1 times [2022-12-13 21:26:00,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:26:00,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452359585] [2022-12-13 21:26:00,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:26:00,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:26:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:01,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:26:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:01,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:26:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:01,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 21:26:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:01,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:26:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:02,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:26:02,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:26:02,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452359585] [2022-12-13 21:26:02,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452359585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:26:02,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:26:02,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 21:26:02,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210320427] [2022-12-13 21:26:02,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:26:02,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 21:26:02,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:26:02,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 21:26:02,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 21:26:02,330 INFO L87 Difference]: Start difference. First operand 95 states and 118 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 21:26:03,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:26:03,142 INFO L93 Difference]: Finished difference Result 199 states and 247 transitions. [2022-12-13 21:26:03,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 21:26:03,142 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-12-13 21:26:03,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:26:03,144 INFO L225 Difference]: With dead ends: 199 [2022-12-13 21:26:03,144 INFO L226 Difference]: Without dead ends: 118 [2022-12-13 21:26:03,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-12-13 21:26:03,146 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 163 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 21:26:03,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 207 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 21:26:03,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-12-13 21:26:03,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 94. [2022-12-13 21:26:03,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 71 states have internal predecessors, (83), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2022-12-13 21:26:03,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 117 transitions. [2022-12-13 21:26:03,153 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 117 transitions. Word has length 41 [2022-12-13 21:26:03,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:26:03,153 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 117 transitions. [2022-12-13 21:26:03,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 21:26:03,153 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2022-12-13 21:26:03,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 21:26:03,154 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:26:03,154 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:26:03,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 21:26:03,154 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:26:03,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:26:03,154 INFO L85 PathProgramCache]: Analyzing trace with hash 28822424, now seen corresponding path program 1 times [2022-12-13 21:26:03,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:26:03,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081713682] [2022-12-13 21:26:03,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:26:03,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:26:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:04,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:26:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:04,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:26:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:04,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 21:26:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:04,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:26:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:04,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 21:26:04,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:26:04,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081713682] [2022-12-13 21:26:04,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081713682] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:26:04,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679309926] [2022-12-13 21:26:04,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:26:04,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:26:04,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:26:04,864 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:26:04,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 21:26:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:05,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 2418 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-13 21:26:05,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:26:05,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:26:05,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:26:05,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-13 21:26:05,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:26:05,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:26:05,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679309926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:26:05,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:26:05,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [16] total 22 [2022-12-13 21:26:05,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336822915] [2022-12-13 21:26:05,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:26:05,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:26:05,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:26:05,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:26:05,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2022-12-13 21:26:05,725 INFO L87 Difference]: Start difference. First operand 94 states and 117 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 21:26:06,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:26:06,452 INFO L93 Difference]: Finished difference Result 197 states and 243 transitions. [2022-12-13 21:26:06,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 21:26:06,452 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-12-13 21:26:06,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:26:06,454 INFO L225 Difference]: With dead ends: 197 [2022-12-13 21:26:06,454 INFO L226 Difference]: Without dead ends: 122 [2022-12-13 21:26:06,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2022-12-13 21:26:06,455 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 70 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 21:26:06,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 278 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 21:26:06,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-12-13 21:26:06,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 100. [2022-12-13 21:26:06,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 76 states have internal predecessors, (89), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2022-12-13 21:26:06,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2022-12-13 21:26:06,468 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 41 [2022-12-13 21:26:06,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:26:06,468 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2022-12-13 21:26:06,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 21:26:06,468 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-12-13 21:26:06,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 21:26:06,469 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:26:06,469 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:26:06,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 21:26:06,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:26:06,671 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:26:06,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:26:06,673 INFO L85 PathProgramCache]: Analyzing trace with hash 286987862, now seen corresponding path program 1 times [2022-12-13 21:26:06,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:26:06,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243361183] [2022-12-13 21:26:06,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:26:06,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:26:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:06,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:26:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:06,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:26:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:06,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 21:26:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:07,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:26:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:07,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:26:07,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:26:07,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243361183] [2022-12-13 21:26:07,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243361183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:26:07,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:26:07,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:26:07,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39530279] [2022-12-13 21:26:07,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:26:07,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:26:07,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:26:07,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:26:07,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:26:07,062 INFO L87 Difference]: Start difference. First operand 100 states and 123 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:26:07,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:26:07,273 INFO L93 Difference]: Finished difference Result 188 states and 236 transitions. [2022-12-13 21:26:07,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:26:07,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2022-12-13 21:26:07,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:26:07,274 INFO L225 Difference]: With dead ends: 188 [2022-12-13 21:26:07,274 INFO L226 Difference]: Without dead ends: 111 [2022-12-13 21:26:07,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:26:07,275 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 63 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:26:07,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 121 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:26:07,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-12-13 21:26:07,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 98. [2022-12-13 21:26:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 74 states have internal predecessors, (84), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2022-12-13 21:26:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2022-12-13 21:26:07,286 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 41 [2022-12-13 21:26:07,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:26:07,286 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2022-12-13 21:26:07,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:26:07,287 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2022-12-13 21:26:07,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-13 21:26:07,288 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:26:07,288 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:26:07,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 21:26:07,288 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:26:07,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:26:07,289 INFO L85 PathProgramCache]: Analyzing trace with hash 379920541, now seen corresponding path program 1 times [2022-12-13 21:26:07,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:26:07,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599801069] [2022-12-13 21:26:07,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:26:07,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:26:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:07,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:26:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:07,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:26:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:07,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 21:26:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:07,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:26:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:07,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:26:07,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:26:07,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599801069] [2022-12-13 21:26:07,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599801069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:26:07,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:26:07,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 21:26:07,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333922942] [2022-12-13 21:26:07,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:26:07,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 21:26:07,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:26:07,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 21:26:07,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-12-13 21:26:07,746 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:26:08,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:26:08,028 INFO L93 Difference]: Finished difference Result 120 states and 141 transitions. [2022-12-13 21:26:08,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 21:26:08,028 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-12-13 21:26:08,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:26:08,029 INFO L225 Difference]: With dead ends: 120 [2022-12-13 21:26:08,029 INFO L226 Difference]: Without dead ends: 118 [2022-12-13 21:26:08,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-12-13 21:26:08,030 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 71 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:26:08,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 316 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:26:08,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-12-13 21:26:08,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2022-12-13 21:26:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 73 states have (on average 1.178082191780822) internal successors, (86), 76 states have internal predecessors, (86), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2022-12-13 21:26:08,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 120 transitions. [2022-12-13 21:26:08,040 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 120 transitions. Word has length 43 [2022-12-13 21:26:08,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:26:08,041 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 120 transitions. [2022-12-13 21:26:08,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 21:26:08,041 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 120 transitions. [2022-12-13 21:26:08,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-13 21:26:08,042 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:26:08,042 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:26:08,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 21:26:08,042 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:26:08,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:26:08,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1080985119, now seen corresponding path program 1 times [2022-12-13 21:26:08,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:26:08,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349690053] [2022-12-13 21:26:08,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:26:08,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:26:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:09,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:26:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:09,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:26:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:09,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 21:26:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:09,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 21:26:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:10,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:26:10,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:26:10,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349690053] [2022-12-13 21:26:10,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349690053] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:26:10,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:26:10,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-13 21:26:10,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795477626] [2022-12-13 21:26:10,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:26:10,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 21:26:10,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:26:10,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 21:26:10,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2022-12-13 21:26:10,059 INFO L87 Difference]: Start difference. First operand 100 states and 120 transitions. Second operand has 20 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 21:26:11,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:26:11,133 INFO L93 Difference]: Finished difference Result 132 states and 154 transitions. [2022-12-13 21:26:11,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 21:26:11,134 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2022-12-13 21:26:11,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:26:11,135 INFO L225 Difference]: With dead ends: 132 [2022-12-13 21:26:11,135 INFO L226 Difference]: Without dead ends: 130 [2022-12-13 21:26:11,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=1148, Unknown=0, NotChecked=0, Total=1332 [2022-12-13 21:26:11,136 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 108 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 21:26:11,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 382 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1350 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 21:26:11,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-12-13 21:26:11,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 93. [2022-12-13 21:26:11,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 70 states have internal predecessors, (81), 15 states have call successors, (15), 8 states have call predecessors, (15), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-12-13 21:26:11,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2022-12-13 21:26:11,146 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 43 [2022-12-13 21:26:11,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:26:11,146 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2022-12-13 21:26:11,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 21:26:11,146 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2022-12-13 21:26:11,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-13 21:26:11,147 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:26:11,147 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:26:11,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 21:26:11,148 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:26:11,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:26:11,148 INFO L85 PathProgramCache]: Analyzing trace with hash -471568136, now seen corresponding path program 1 times [2022-12-13 21:26:11,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:26:11,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644217980] [2022-12-13 21:26:11,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:26:11,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:26:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:11,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:26:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:11,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:26:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:11,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:26:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:11,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:26:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:11,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:26:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:11,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 21:26:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:11,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:26:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:11,390 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 21:26:11,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:26:11,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644217980] [2022-12-13 21:26:11,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644217980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:26:11,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:26:11,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 21:26:11,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208767609] [2022-12-13 21:26:11,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:26:11,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:26:11,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:26:11,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:26:11,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:26:11,392 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 21:26:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:26:11,570 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2022-12-13 21:26:11,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:26:11,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2022-12-13 21:26:11,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:26:11,572 INFO L225 Difference]: With dead ends: 125 [2022-12-13 21:26:11,572 INFO L226 Difference]: Without dead ends: 93 [2022-12-13 21:26:11,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-13 21:26:11,573 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 100 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:26:11,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 87 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 21:26:11,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-12-13 21:26:11,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-12-13 21:26:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 70 states have internal predecessors, (80), 15 states have call successors, (15), 8 states have call predecessors, (15), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-12-13 21:26:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 110 transitions. [2022-12-13 21:26:11,580 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 110 transitions. Word has length 52 [2022-12-13 21:26:11,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:26:11,580 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 110 transitions. [2022-12-13 21:26:11,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 21:26:11,581 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 110 transitions. [2022-12-13 21:26:11,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 21:26:11,581 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:26:11,581 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 21:26:11,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 21:26:11,582 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:26:11,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:26:11,582 INFO L85 PathProgramCache]: Analyzing trace with hash 416252355, now seen corresponding path program 1 times [2022-12-13 21:26:11,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:26:11,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114480753] [2022-12-13 21:26:11,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:26:11,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:26:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:11,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:26:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:11,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:26:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:11,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:26:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:11,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:26:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:11,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:26:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:11,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 21:26:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:11,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:26:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:11,997 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 21:26:11,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:26:11,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114480753] [2022-12-13 21:26:11,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114480753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:26:11,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:26:11,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 21:26:11,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774235795] [2022-12-13 21:26:11,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:26:11,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 21:26:11,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:26:11,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 21:26:11,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 21:26:11,999 INFO L87 Difference]: Start difference. First operand 93 states and 110 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-13 21:26:12,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:26:12,303 INFO L93 Difference]: Finished difference Result 109 states and 127 transitions. [2022-12-13 21:26:12,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 21:26:12,304 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 58 [2022-12-13 21:26:12,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:26:12,304 INFO L225 Difference]: With dead ends: 109 [2022-12-13 21:26:12,304 INFO L226 Difference]: Without dead ends: 107 [2022-12-13 21:26:12,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-12-13 21:26:12,305 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 60 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:26:12,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 240 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:26:12,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-12-13 21:26:12,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2022-12-13 21:26:12,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 77 states have (on average 1.155844155844156) internal successors, (89), 81 states have internal predecessors, (89), 16 states have call successors, (16), 9 states have call predecessors, (16), 12 states have return successors, (19), 15 states have call predecessors, (19), 15 states have call successors, (19) [2022-12-13 21:26:12,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2022-12-13 21:26:12,311 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 58 [2022-12-13 21:26:12,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:26:12,311 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2022-12-13 21:26:12,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-13 21:26:12,311 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2022-12-13 21:26:12,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-13 21:26:12,312 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:26:12,312 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:26:12,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 21:26:12,312 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:26:12,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:26:12,312 INFO L85 PathProgramCache]: Analyzing trace with hash 361728585, now seen corresponding path program 1 times [2022-12-13 21:26:12,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:26:12,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682335618] [2022-12-13 21:26:12,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:26:12,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:26:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:13,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:26:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:13,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:26:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:13,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:26:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:14,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:26:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:14,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:26:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:14,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 21:26:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:14,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:26:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:14,299 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 21:26:14,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:26:14,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682335618] [2022-12-13 21:26:14,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682335618] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:26:14,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299841946] [2022-12-13 21:26:14,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:26:14,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:26:14,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:26:14,301 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:26:14,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 21:26:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:14,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 2504 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 21:26:14,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:26:14,871 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 21:26:15,602 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:26:15,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:26:16,030 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 21:26:16,031 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 129 treesize of output 1 [2022-12-13 21:26:16,323 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-13 21:26:16,323 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 30 treesize of output 25 [2022-12-13 21:26:16,377 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 21:26:16,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299841946] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:26:16,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:26:16,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 14] total 38 [2022-12-13 21:26:16,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299272034] [2022-12-13 21:26:16,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:26:16,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-13 21:26:16,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:26:16,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-13 21:26:16,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1272, Unknown=0, NotChecked=0, Total=1406 [2022-12-13 21:26:16,380 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand has 38 states, 33 states have (on average 2.727272727272727) internal successors, (90), 31 states have internal predecessors, (90), 9 states have call successors, (16), 5 states have call predecessors, (16), 9 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2022-12-13 21:26:19,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:26:19,880 INFO L93 Difference]: Finished difference Result 246 states and 288 transitions. [2022-12-13 21:26:19,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-13 21:26:19,881 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 33 states have (on average 2.727272727272727) internal successors, (90), 31 states have internal predecessors, (90), 9 states have call successors, (16), 5 states have call predecessors, (16), 9 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) Word has length 62 [2022-12-13 21:26:19,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:26:19,881 INFO L225 Difference]: With dead ends: 246 [2022-12-13 21:26:19,882 INFO L226 Difference]: Without dead ends: 206 [2022-12-13 21:26:19,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 114 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=590, Invalid=3192, Unknown=0, NotChecked=0, Total=3782 [2022-12-13 21:26:19,883 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 369 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 1954 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 2034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-13 21:26:19,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 294 Invalid, 2034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1954 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-12-13 21:26:19,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-12-13 21:26:19,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 144. [2022-12-13 21:26:19,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 109 states have (on average 1.1743119266055047) internal successors, (128), 114 states have internal predecessors, (128), 18 states have call successors, (18), 11 states have call predecessors, (18), 16 states have return successors, (23), 18 states have call predecessors, (23), 17 states have call successors, (23) [2022-12-13 21:26:19,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions. [2022-12-13 21:26:19,891 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 62 [2022-12-13 21:26:19,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:26:19,891 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 169 transitions. [2022-12-13 21:26:19,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 33 states have (on average 2.727272727272727) internal successors, (90), 31 states have internal predecessors, (90), 9 states have call successors, (16), 5 states have call predecessors, (16), 9 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2022-12-13 21:26:19,891 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions. [2022-12-13 21:26:19,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-13 21:26:19,892 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:26:19,892 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:26:19,900 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 21:26:20,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:26:20,094 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:26:20,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:26:20,095 INFO L85 PathProgramCache]: Analyzing trace with hash -918135093, now seen corresponding path program 1 times [2022-12-13 21:26:20,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:26:20,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023831498] [2022-12-13 21:26:20,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:26:20,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:26:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:20,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:26:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:20,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:26:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:20,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:26:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:20,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:26:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:20,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:26:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:20,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 21:26:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:20,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:26:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:21,055 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 21:26:21,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:26:21,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023831498] [2022-12-13 21:26:21,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023831498] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:26:21,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110309028] [2022-12-13 21:26:21,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:26:21,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:26:21,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:26:21,056 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:26:21,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 21:26:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:21,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 2499 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-13 21:26:21,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:26:21,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:26:21,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:26:21,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-13 21:26:22,134 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:26:22,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:26:22,473 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 346 treesize of output 334 [2022-12-13 21:26:22,787 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 21:26:22,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110309028] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:26:22,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:26:22,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 14] total 38 [2022-12-13 21:26:22,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456157752] [2022-12-13 21:26:22,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:26:22,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-13 21:26:22,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:26:22,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-13 21:26:22,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1264, Unknown=0, NotChecked=0, Total=1406 [2022-12-13 21:26:22,791 INFO L87 Difference]: Start difference. First operand 144 states and 169 transitions. Second operand has 38 states, 34 states have (on average 2.5) internal successors, (85), 31 states have internal predecessors, (85), 9 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-12-13 21:26:25,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:26:25,054 INFO L93 Difference]: Finished difference Result 316 states and 365 transitions. [2022-12-13 21:26:25,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 21:26:25,055 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 34 states have (on average 2.5) internal successors, (85), 31 states have internal predecessors, (85), 9 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) Word has length 62 [2022-12-13 21:26:25,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:26:25,057 INFO L225 Difference]: With dead ends: 316 [2022-12-13 21:26:25,057 INFO L226 Difference]: Without dead ends: 266 [2022-12-13 21:26:25,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 108 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=408, Invalid=2774, Unknown=10, NotChecked=0, Total=3192 [2022-12-13 21:26:25,059 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 538 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 1935 mSolverCounterSat, 108 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 2057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1935 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:26:25,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 193 Invalid, 2057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1935 Invalid, 14 Unknown, 0 Unchecked, 1.3s Time] [2022-12-13 21:26:25,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-12-13 21:26:25,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 183. [2022-12-13 21:26:25,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 141 states have (on average 1.1702127659574468) internal successors, (165), 148 states have internal predecessors, (165), 20 states have call successors, (20), 13 states have call predecessors, (20), 21 states have return successors, (29), 21 states have call predecessors, (29), 19 states have call successors, (29) [2022-12-13 21:26:25,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 214 transitions. [2022-12-13 21:26:25,072 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 214 transitions. Word has length 62 [2022-12-13 21:26:25,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:26:25,072 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 214 transitions. [2022-12-13 21:26:25,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 34 states have (on average 2.5) internal successors, (85), 31 states have internal predecessors, (85), 9 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-12-13 21:26:25,072 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 214 transitions. [2022-12-13 21:26:25,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-13 21:26:25,073 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:26:25,073 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:26:25,080 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 21:26:25,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 21:26:25,274 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:26:25,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:26:25,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1530318863, now seen corresponding path program 1 times [2022-12-13 21:26:25,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:26:25,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873553906] [2022-12-13 21:26:25,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:26:25,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:26:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:26,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:26:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:26,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:26:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:26,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:26:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:26,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:26:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:26,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:26:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:26,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 21:26:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:26,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:26:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:26,850 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:26:26,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:26:26,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873553906] [2022-12-13 21:26:26,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873553906] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:26:26,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912238278] [2022-12-13 21:26:26,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:26:26,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:26:26,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:26:26,852 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:26:26,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 21:26:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:27,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 2501 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-13 21:26:27,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:26:27,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:26:27,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:26:27,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-13 21:26:28,329 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:26:28,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:26:29,022 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 21:26:29,023 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 11586 treesize of output 1 [2022-12-13 21:26:29,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912238278] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:26:29,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 21:26:29,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 37 [2022-12-13 21:26:29,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205896207] [2022-12-13 21:26:29,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 21:26:29,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-13 21:26:29,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:26:29,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-13 21:26:29,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2000, Unknown=0, NotChecked=0, Total=2162 [2022-12-13 21:26:29,237 INFO L87 Difference]: Start difference. First operand 183 states and 214 transitions. Second operand has 37 states, 32 states have (on average 2.3125) internal successors, (74), 30 states have internal predecessors, (74), 11 states have call successors, (15), 5 states have call predecessors, (15), 9 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-12-13 21:26:34,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:26:34,475 INFO L93 Difference]: Finished difference Result 302 states and 347 transitions. [2022-12-13 21:26:34,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-13 21:26:34,476 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 32 states have (on average 2.3125) internal successors, (74), 30 states have internal predecessors, (74), 11 states have call successors, (15), 5 states have call predecessors, (15), 9 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) Word has length 62 [2022-12-13 21:26:34,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:26:34,478 INFO L225 Difference]: With dead ends: 302 [2022-12-13 21:26:34,478 INFO L226 Difference]: Without dead ends: 263 [2022-12-13 21:26:34,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1681 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=689, Invalid=6775, Unknown=18, NotChecked=0, Total=7482 [2022-12-13 21:26:34,482 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 500 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 3244 mSolverCounterSat, 150 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 3405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 3244 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:26:34,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 290 Invalid, 3405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 3244 Invalid, 11 Unknown, 0 Unchecked, 3.0s Time] [2022-12-13 21:26:34,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-12-13 21:26:34,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 185. [2022-12-13 21:26:34,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 143 states have (on average 1.1608391608391608) internal successors, (166), 150 states have internal predecessors, (166), 20 states have call successors, (20), 13 states have call predecessors, (20), 21 states have return successors, (29), 21 states have call predecessors, (29), 19 states have call successors, (29) [2022-12-13 21:26:34,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 215 transitions. [2022-12-13 21:26:34,495 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 215 transitions. Word has length 62 [2022-12-13 21:26:34,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:26:34,495 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 215 transitions. [2022-12-13 21:26:34,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 32 states have (on average 2.3125) internal successors, (74), 30 states have internal predecessors, (74), 11 states have call successors, (15), 5 states have call predecessors, (15), 9 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-12-13 21:26:34,495 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 215 transitions. [2022-12-13 21:26:34,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-13 21:26:34,495 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:26:34,496 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:26:34,503 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 21:26:34,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 21:26:34,697 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:26:34,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:26:34,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1953106119, now seen corresponding path program 1 times [2022-12-13 21:26:34,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:26:34,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465110022] [2022-12-13 21:26:34,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:26:34,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:26:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:34,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:26:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:34,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:26:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:34,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:26:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:34,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:26:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:34,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:26:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:34,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 21:26:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:34,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:26:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:34,913 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 21:26:34,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:26:34,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465110022] [2022-12-13 21:26:34,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465110022] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:26:34,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59097532] [2022-12-13 21:26:34,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:26:34,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:26:34,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:26:34,915 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:26:34,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 21:26:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:35,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 2491 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 21:26:35,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:26:35,188 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 21:26:35,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:26:35,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59097532] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:26:35,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:26:35,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-12-13 21:26:35,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727082686] [2022-12-13 21:26:35,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:26:35,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:26:35,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:26:35,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:26:35,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:26:35,189 INFO L87 Difference]: Start difference. First operand 185 states and 215 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 21:26:35,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:26:35,210 INFO L93 Difference]: Finished difference Result 231 states and 267 transitions. [2022-12-13 21:26:35,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:26:35,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2022-12-13 21:26:35,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:26:35,211 INFO L225 Difference]: With dead ends: 231 [2022-12-13 21:26:35,211 INFO L226 Difference]: Without dead ends: 147 [2022-12-13 21:26:35,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:26:35,212 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 20 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 21:26:35,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 232 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 21:26:35,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-12-13 21:26:35,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 139. [2022-12-13 21:26:35,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 105 states have (on average 1.1238095238095238) internal successors, (118), 109 states have internal predecessors, (118), 18 states have call successors, (18), 11 states have call predecessors, (18), 15 states have return successors, (22), 18 states have call predecessors, (22), 17 states have call successors, (22) [2022-12-13 21:26:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 158 transitions. [2022-12-13 21:26:35,222 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 158 transitions. Word has length 62 [2022-12-13 21:26:35,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:26:35,222 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 158 transitions. [2022-12-13 21:26:35,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 21:26:35,222 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 158 transitions. [2022-12-13 21:26:35,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-12-13 21:26:35,223 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:26:35,223 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:26:35,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 21:26:35,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 21:26:35,423 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:26:35,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:26:35,424 INFO L85 PathProgramCache]: Analyzing trace with hash -357159951, now seen corresponding path program 1 times [2022-12-13 21:26:35,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:26:35,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382350781] [2022-12-13 21:26:35,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:26:35,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:26:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:36,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:26:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:36,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:26:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:36,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:26:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:36,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:26:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:36,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:26:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:36,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 21:26:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:36,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:26:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:36,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:26:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:36,782 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 21:26:36,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:26:36,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382350781] [2022-12-13 21:26:36,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382350781] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:26:36,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380606020] [2022-12-13 21:26:36,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:26:36,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:26:36,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:26:36,784 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:26:36,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 21:26:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:37,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 2508 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 21:26:37,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:26:37,186 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 21 treesize of output 26 [2022-12-13 21:26:37,507 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 21:26:37,507 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 26 treesize of output 10 [2022-12-13 21:26:37,551 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 21:26:37,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:26:37,853 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 814 treesize of output 798 [2022-12-13 21:26:38,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380606020] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:26:38,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 21:26:38,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2022-12-13 21:26:38,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761378654] [2022-12-13 21:26:38,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 21:26:38,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 21:26:38,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:26:38,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 21:26:38,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1098, Unknown=0, NotChecked=0, Total=1190 [2022-12-13 21:26:38,191 INFO L87 Difference]: Start difference. First operand 139 states and 158 transitions. Second operand has 28 states, 25 states have (on average 2.28) internal successors, (57), 21 states have internal predecessors, (57), 9 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) [2022-12-13 21:26:40,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:26:40,567 INFO L93 Difference]: Finished difference Result 171 states and 198 transitions. [2022-12-13 21:26:40,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 21:26:40,567 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.28) internal successors, (57), 21 states have internal predecessors, (57), 9 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) Word has length 64 [2022-12-13 21:26:40,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:26:40,568 INFO L225 Difference]: With dead ends: 171 [2022-12-13 21:26:40,568 INFO L226 Difference]: Without dead ends: 169 [2022-12-13 21:26:40,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 90 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=281, Invalid=2911, Unknown=0, NotChecked=0, Total=3192 [2022-12-13 21:26:40,569 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 234 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 1842 mSolverCounterSat, 51 mSolverCounterUnsat, 55 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 1948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1842 IncrementalHoareTripleChecker+Invalid, 55 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-13 21:26:40,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 310 Invalid, 1948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1842 Invalid, 55 Unknown, 0 Unchecked, 1.5s Time] [2022-12-13 21:26:40,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-12-13 21:26:40,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 143. [2022-12-13 21:26:40,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 108 states have (on average 1.1203703703703705) internal successors, (121), 112 states have internal predecessors, (121), 18 states have call successors, (18), 12 states have call predecessors, (18), 16 states have return successors, (22), 18 states have call predecessors, (22), 17 states have call successors, (22) [2022-12-13 21:26:40,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 161 transitions. [2022-12-13 21:26:40,581 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 161 transitions. Word has length 64 [2022-12-13 21:26:40,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:26:40,581 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 161 transitions. [2022-12-13 21:26:40,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.28) internal successors, (57), 21 states have internal predecessors, (57), 9 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) [2022-12-13 21:26:40,581 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 161 transitions. [2022-12-13 21:26:40,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-12-13 21:26:40,582 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:26:40,582 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:26:40,589 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 21:26:40,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 21:26:40,784 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:26:40,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:26:40,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1477485396, now seen corresponding path program 1 times [2022-12-13 21:26:40,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:26:40,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759199381] [2022-12-13 21:26:40,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:26:40,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:26:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:41,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:26:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:41,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:26:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:41,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:26:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:41,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:26:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:41,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:26:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:41,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 21:26:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:41,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:26:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:41,279 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 21:26:41,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:26:41,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759199381] [2022-12-13 21:26:41,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759199381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:26:41,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:26:41,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 21:26:41,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919526073] [2022-12-13 21:26:41,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:26:41,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 21:26:41,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:26:41,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 21:26:41,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-12-13 21:26:41,280 INFO L87 Difference]: Start difference. First operand 143 states and 161 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-13 21:26:41,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:26:41,706 INFO L93 Difference]: Finished difference Result 169 states and 188 transitions. [2022-12-13 21:26:41,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 21:26:41,706 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 64 [2022-12-13 21:26:41,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:26:41,707 INFO L225 Difference]: With dead ends: 169 [2022-12-13 21:26:41,707 INFO L226 Difference]: Without dead ends: 167 [2022-12-13 21:26:41,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-12-13 21:26:41,707 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 107 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:26:41,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 296 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 21:26:41,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-12-13 21:26:41,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 157. [2022-12-13 21:26:41,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 120 states have (on average 1.1083333333333334) internal successors, (133), 126 states have internal predecessors, (133), 18 states have call successors, (18), 12 states have call predecessors, (18), 18 states have return successors, (25), 18 states have call predecessors, (25), 17 states have call successors, (25) [2022-12-13 21:26:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 176 transitions. [2022-12-13 21:26:41,719 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 176 transitions. Word has length 64 [2022-12-13 21:26:41,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:26:41,719 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 176 transitions. [2022-12-13 21:26:41,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-13 21:26:41,719 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 176 transitions. [2022-12-13 21:26:41,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-12-13 21:26:41,719 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:26:41,720 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:26:41,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 21:26:41,720 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:26:41,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:26:41,720 INFO L85 PathProgramCache]: Analyzing trace with hash -2116417322, now seen corresponding path program 1 times [2022-12-13 21:26:41,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:26:41,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253485183] [2022-12-13 21:26:41,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:26:41,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:26:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:42,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:26:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:42,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:26:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:42,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:26:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:42,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:26:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:42,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:26:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:42,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 21:26:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:42,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:26:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:42,986 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 21:26:42,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:26:42,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253485183] [2022-12-13 21:26:42,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253485183] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:26:42,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062447214] [2022-12-13 21:26:42,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:26:42,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:26:42,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:26:42,988 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:26:42,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 21:26:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:43,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 2511 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-13 21:26:43,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:26:43,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:26:43,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:26:43,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-13 21:26:44,085 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:26:44,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:26:44,414 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 3036 treesize of output 2940 [2022-12-13 21:26:47,139 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 21:26:47,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062447214] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:26:47,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:26:47,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 13] total 34 [2022-12-13 21:26:47,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276619535] [2022-12-13 21:26:47,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:26:47,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 21:26:47,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:26:47,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 21:26:47,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1010, Unknown=0, NotChecked=0, Total=1122 [2022-12-13 21:26:47,142 INFO L87 Difference]: Start difference. First operand 157 states and 176 transitions. Second operand has 34 states, 30 states have (on average 3.1) internal successors, (93), 27 states have internal predecessors, (93), 9 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-12-13 21:26:49,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:26:49,374 INFO L93 Difference]: Finished difference Result 269 states and 297 transitions. [2022-12-13 21:26:49,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-13 21:26:49,374 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 3.1) internal successors, (93), 27 states have internal predecessors, (93), 9 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) Word has length 64 [2022-12-13 21:26:49,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:26:49,375 INFO L225 Difference]: With dead ends: 269 [2022-12-13 21:26:49,375 INFO L226 Difference]: Without dead ends: 224 [2022-12-13 21:26:49,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 118 SyntacticMatches, 7 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=410, Invalid=2658, Unknown=12, NotChecked=0, Total=3080 [2022-12-13 21:26:49,376 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 502 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 1938 mSolverCounterSat, 121 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 2064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1938 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:26:49,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 204 Invalid, 2064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1938 Invalid, 5 Unknown, 0 Unchecked, 1.3s Time] [2022-12-13 21:26:49,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-12-13 21:26:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 155. [2022-12-13 21:26:49,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 119 states have (on average 1.1092436974789917) internal successors, (132), 124 states have internal predecessors, (132), 18 states have call successors, (18), 12 states have call predecessors, (18), 17 states have return successors, (24), 18 states have call predecessors, (24), 17 states have call successors, (24) [2022-12-13 21:26:49,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 174 transitions. [2022-12-13 21:26:49,388 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 174 transitions. Word has length 64 [2022-12-13 21:26:49,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:26:49,389 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 174 transitions. [2022-12-13 21:26:49,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 3.1) internal successors, (93), 27 states have internal predecessors, (93), 9 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-12-13 21:26:49,389 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 174 transitions. [2022-12-13 21:26:49,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-13 21:26:49,389 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:26:49,389 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-12-13 21:26:49,398 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 21:26:49,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:26:49,591 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:26:49,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:26:49,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1604664163, now seen corresponding path program 1 times [2022-12-13 21:26:49,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:26:49,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570501742] [2022-12-13 21:26:49,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:26:49,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:26:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:50,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:26:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:50,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:26:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:50,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:26:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:51,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:26:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:51,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:26:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:51,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 21:26:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:51,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:26:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:51,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:26:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:51,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 21:26:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:51,218 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 21:26:51,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:26:51,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570501742] [2022-12-13 21:26:51,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570501742] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:26:51,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111034832] [2022-12-13 21:26:51,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:26:51,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:26:51,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:26:51,220 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:26:51,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 21:26:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:26:51,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 2519 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-13 21:26:51,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:26:51,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:26:51,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:26:51,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-13 21:26:53,152 INFO L321 Elim1Store]: treesize reduction 13, result has 51.9 percent of original size [2022-12-13 21:26:53,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 34 [2022-12-13 21:26:53,244 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 21:26:53,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:26:53,841 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 3208 treesize of output 3112 [2022-12-13 21:26:54,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111034832] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:26:54,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 21:26:54,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23] total 35 [2022-12-13 21:26:54,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171748243] [2022-12-13 21:26:54,317 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 21:26:54,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-13 21:26:54,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:26:54,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-13 21:26:54,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1679, Unknown=0, NotChecked=0, Total=1806 [2022-12-13 21:26:54,319 INFO L87 Difference]: Start difference. First operand 155 states and 174 transitions. Second operand has 35 states, 30 states have (on average 2.566666666666667) internal successors, (77), 27 states have internal predecessors, (77), 10 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (15), 9 states have call predecessors, (15), 8 states have call successors, (15) [2022-12-13 21:27:00,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:27:00,267 INFO L93 Difference]: Finished difference Result 239 states and 260 transitions. [2022-12-13 21:27:00,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-13 21:27:00,267 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 30 states have (on average 2.566666666666667) internal successors, (77), 27 states have internal predecessors, (77), 10 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (15), 9 states have call predecessors, (15), 8 states have call successors, (15) Word has length 70 [2022-12-13 21:27:00,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:27:00,269 INFO L225 Difference]: With dead ends: 239 [2022-12-13 21:27:00,269 INFO L226 Difference]: Without dead ends: 237 [2022-12-13 21:27:00,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 97 SyntacticMatches, 7 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1405 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=628, Invalid=5843, Unknown=9, NotChecked=0, Total=6480 [2022-12-13 21:27:00,271 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 330 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 2415 mSolverCounterSat, 91 mSolverCounterUnsat, 69 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 2575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2415 IncrementalHoareTripleChecker+Invalid, 69 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-12-13 21:27:00,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 277 Invalid, 2575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2415 Invalid, 69 Unknown, 0 Unchecked, 2.4s Time] [2022-12-13 21:27:00,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-12-13 21:27:00,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 194. [2022-12-13 21:27:00,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 144 states have (on average 1.0972222222222223) internal successors, (158), 149 states have internal predecessors, (158), 26 states have call successors, (26), 18 states have call predecessors, (26), 23 states have return successors, (31), 26 states have call predecessors, (31), 24 states have call successors, (31) [2022-12-13 21:27:00,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 215 transitions. [2022-12-13 21:27:00,290 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 215 transitions. Word has length 70 [2022-12-13 21:27:00,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:27:00,290 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 215 transitions. [2022-12-13 21:27:00,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 30 states have (on average 2.566666666666667) internal successors, (77), 27 states have internal predecessors, (77), 10 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (15), 9 states have call predecessors, (15), 8 states have call successors, (15) [2022-12-13 21:27:00,290 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 215 transitions. [2022-12-13 21:27:00,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-13 21:27:00,291 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:27:00,291 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:27:00,297 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 21:27:00,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:27:00,493 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:27:00,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:27:00,494 INFO L85 PathProgramCache]: Analyzing trace with hash 809840792, now seen corresponding path program 1 times [2022-12-13 21:27:00,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:27:00,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995132715] [2022-12-13 21:27:00,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:27:00,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:27:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:02,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:27:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:02,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:27:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:02,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:27:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:02,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:27:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:02,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:27:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:03,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 21:27:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:03,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 21:27:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:03,157 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 21:27:03,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:27:03,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995132715] [2022-12-13 21:27:03,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995132715] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:27:03,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708564004] [2022-12-13 21:27:03,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:27:03,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:27:03,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:27:03,159 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:27:03,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 21:27:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:03,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 2513 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-13 21:27:03,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:27:03,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:27:03,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:27:03,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-13 21:27:04,015 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-12-13 21:27:04,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 21 [2022-12-13 21:27:04,018 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 21:27:04,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:27:04,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708564004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:27:04,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:27:04,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [24] total 32 [2022-12-13 21:27:04,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982000662] [2022-12-13 21:27:04,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:27:04,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 21:27:04,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:27:04,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 21:27:04,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=897, Unknown=0, NotChecked=0, Total=992 [2022-12-13 21:27:04,020 INFO L87 Difference]: Start difference. First operand 194 states and 215 transitions. Second operand has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-13 21:27:04,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:27:04,805 INFO L93 Difference]: Finished difference Result 326 states and 361 transitions. [2022-12-13 21:27:04,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 21:27:04,806 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 68 [2022-12-13 21:27:04,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:27:04,806 INFO L225 Difference]: With dead ends: 326 [2022-12-13 21:27:04,806 INFO L226 Difference]: Without dead ends: 220 [2022-12-13 21:27:04,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=1253, Unknown=0, NotChecked=0, Total=1406 [2022-12-13 21:27:04,807 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 92 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 21:27:04,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 363 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 21:27:04,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-12-13 21:27:04,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 188. [2022-12-13 21:27:04,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 139 states have (on average 1.1007194244604317) internal successors, (153), 143 states have internal predecessors, (153), 26 states have call successors, (26), 18 states have call predecessors, (26), 22 states have return successors, (29), 26 states have call predecessors, (29), 24 states have call successors, (29) [2022-12-13 21:27:04,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 208 transitions. [2022-12-13 21:27:04,826 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 208 transitions. Word has length 68 [2022-12-13 21:27:04,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:27:04,827 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 208 transitions. [2022-12-13 21:27:04,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-13 21:27:04,827 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 208 transitions. [2022-12-13 21:27:04,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-13 21:27:04,827 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:27:04,827 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:27:04,835 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 21:27:05,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:27:05,029 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:27:05,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:27:05,030 INFO L85 PathProgramCache]: Analyzing trace with hash 415474006, now seen corresponding path program 1 times [2022-12-13 21:27:05,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:27:05,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230101788] [2022-12-13 21:27:05,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:27:05,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:27:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:05,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:27:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:05,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:27:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:05,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:27:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:06,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:27:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:06,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:27:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:06,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 21:27:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:06,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 21:27:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:06,391 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 21:27:06,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:27:06,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230101788] [2022-12-13 21:27:06,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230101788] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:27:06,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120685828] [2022-12-13 21:27:06,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:27:06,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:27:06,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:27:06,393 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:27:06,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 21:27:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:06,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 2518 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-13 21:27:06,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:27:06,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:27:06,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:27:06,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-13 21:27:07,612 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:27:07,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:27:07,891 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 792 treesize of output 768 [2022-12-13 21:27:08,289 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 21:27:08,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120685828] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:27:08,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:27:08,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 13] total 35 [2022-12-13 21:27:08,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519752479] [2022-12-13 21:27:08,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:27:08,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-13 21:27:08,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:27:08,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-13 21:27:08,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2022-12-13 21:27:08,292 INFO L87 Difference]: Start difference. First operand 188 states and 208 transitions. Second operand has 35 states, 31 states have (on average 3.096774193548387) internal successors, (96), 28 states have internal predecessors, (96), 9 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-12-13 21:27:10,669 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 21:27:13,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 21:27:14,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:27:14,520 INFO L93 Difference]: Finished difference Result 292 states and 318 transitions. [2022-12-13 21:27:14,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 21:27:14,520 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 3.096774193548387) internal successors, (96), 28 states have internal predecessors, (96), 9 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) Word has length 68 [2022-12-13 21:27:14,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:27:14,521 INFO L225 Difference]: With dead ends: 292 [2022-12-13 21:27:14,521 INFO L226 Difference]: Without dead ends: 193 [2022-12-13 21:27:14,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 128 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=377, Invalid=2485, Unknown=0, NotChecked=0, Total=2862 [2022-12-13 21:27:14,522 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 274 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 71 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 1766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-12-13 21:27:14,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 317 Invalid, 1766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1683 Invalid, 12 Unknown, 0 Unchecked, 5.4s Time] [2022-12-13 21:27:14,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-12-13 21:27:14,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 178. [2022-12-13 21:27:14,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 132 states have (on average 1.0606060606060606) internal successors, (140), 134 states have internal predecessors, (140), 25 states have call successors, (25), 18 states have call predecessors, (25), 20 states have return successors, (25), 25 states have call predecessors, (25), 23 states have call successors, (25) [2022-12-13 21:27:14,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 190 transitions. [2022-12-13 21:27:14,541 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 190 transitions. Word has length 68 [2022-12-13 21:27:14,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:27:14,541 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 190 transitions. [2022-12-13 21:27:14,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 3.096774193548387) internal successors, (96), 28 states have internal predecessors, (96), 9 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-12-13 21:27:14,542 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 190 transitions. [2022-12-13 21:27:14,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-13 21:27:14,542 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:27:14,542 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:27:14,550 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 21:27:14,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:27:14,744 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:27:14,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:27:14,745 INFO L85 PathProgramCache]: Analyzing trace with hash -864389672, now seen corresponding path program 1 times [2022-12-13 21:27:14,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:27:14,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588414531] [2022-12-13 21:27:14,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:27:14,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:27:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:16,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:27:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:16,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:27:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:16,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:27:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:17,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:27:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:17,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:27:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:17,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 21:27:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:17,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 21:27:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:17,454 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 21:27:17,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:27:17,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588414531] [2022-12-13 21:27:17,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588414531] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:27:17,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074270764] [2022-12-13 21:27:17,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:27:17,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:27:17,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:27:17,455 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:27:17,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 21:27:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:18,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 2513 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 21:27:18,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:27:18,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:27:18,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:27:18,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-13 21:27:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 21:27:19,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:27:19,756 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 343 treesize of output 331 [2022-12-13 21:27:20,132 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 21:27:20,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074270764] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 21:27:20,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 21:27:20,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 13] total 40 [2022-12-13 21:27:20,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740547352] [2022-12-13 21:27:20,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 21:27:20,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-12-13 21:27:20,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:27:20,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-13 21:27:20,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1406, Unknown=0, NotChecked=0, Total=1560 [2022-12-13 21:27:20,134 INFO L87 Difference]: Start difference. First operand 178 states and 190 transitions. Second operand has 40 states, 34 states have (on average 3.6470588235294117) internal successors, (124), 32 states have internal predecessors, (124), 11 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (15), 8 states have call predecessors, (15), 10 states have call successors, (15) [2022-12-13 21:27:22,633 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 21:27:24,785 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 21:27:27,718 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 21:27:30,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:27:30,801 INFO L93 Difference]: Finished difference Result 241 states and 256 transitions. [2022-12-13 21:27:30,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-13 21:27:30,801 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 34 states have (on average 3.6470588235294117) internal successors, (124), 32 states have internal predecessors, (124), 11 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (15), 8 states have call predecessors, (15), 10 states have call successors, (15) Word has length 68 [2022-12-13 21:27:30,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:27:30,802 INFO L225 Difference]: With dead ends: 241 [2022-12-13 21:27:30,802 INFO L226 Difference]: Without dead ends: 194 [2022-12-13 21:27:30,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 126 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=646, Invalid=3776, Unknown=0, NotChecked=0, Total=4422 [2022-12-13 21:27:30,803 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 259 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 2726 mSolverCounterSat, 96 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 2830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2726 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-12-13 21:27:30,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 405 Invalid, 2830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2726 Invalid, 8 Unknown, 0 Unchecked, 8.9s Time] [2022-12-13 21:27:30,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-12-13 21:27:30,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 173. [2022-12-13 21:27:30,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 127 states have (on average 1.0551181102362204) internal successors, (134), 129 states have internal predecessors, (134), 25 states have call successors, (25), 18 states have call predecessors, (25), 20 states have return successors, (25), 25 states have call predecessors, (25), 23 states have call successors, (25) [2022-12-13 21:27:30,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 184 transitions. [2022-12-13 21:27:30,824 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 184 transitions. Word has length 68 [2022-12-13 21:27:30,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:27:30,824 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 184 transitions. [2022-12-13 21:27:30,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 34 states have (on average 3.6470588235294117) internal successors, (124), 32 states have internal predecessors, (124), 11 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (15), 8 states have call predecessors, (15), 10 states have call successors, (15) [2022-12-13 21:27:30,824 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 184 transitions. [2022-12-13 21:27:30,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-13 21:27:30,824 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:27:30,824 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:27:30,832 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 21:27:31,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 21:27:31,025 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:27:31,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:27:31,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1584064284, now seen corresponding path program 1 times [2022-12-13 21:27:31,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:27:31,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004172522] [2022-12-13 21:27:31,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:27:31,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:27:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:33,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:27:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:33,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:27:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:33,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:27:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:33,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:27:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:33,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:27:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:33,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 21:27:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:33,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 21:27:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:34,135 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 21:27:34,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:27:34,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004172522] [2022-12-13 21:27:34,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004172522] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:27:34,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097921062] [2022-12-13 21:27:34,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:27:34,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:27:34,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:27:34,137 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:27:34,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 21:27:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:34,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 2515 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-13 21:27:34,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:27:34,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:27:34,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:27:34,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-13 21:27:35,364 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 21:27:35,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 21:27:35,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097921062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:27:35,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 21:27:35,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 27 [2022-12-13 21:27:35,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552004767] [2022-12-13 21:27:35,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:27:35,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 21:27:35,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:27:35,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 21:27:35,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2022-12-13 21:27:35,366 INFO L87 Difference]: Start difference. First operand 173 states and 184 transitions. Second operand has 13 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-12-13 21:27:36,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:27:36,391 INFO L93 Difference]: Finished difference Result 213 states and 227 transitions. [2022-12-13 21:27:36,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 21:27:36,392 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 68 [2022-12-13 21:27:36,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:27:36,392 INFO L225 Difference]: With dead ends: 213 [2022-12-13 21:27:36,392 INFO L226 Difference]: Without dead ends: 175 [2022-12-13 21:27:36,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=138, Invalid=918, Unknown=0, NotChecked=0, Total=1056 [2022-12-13 21:27:36,393 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 70 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 21:27:36,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 372 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 21:27:36,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-12-13 21:27:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2022-12-13 21:27:36,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 127 states have (on average 1.047244094488189) internal successors, (133), 129 states have internal predecessors, (133), 25 states have call successors, (25), 18 states have call predecessors, (25), 20 states have return successors, (25), 25 states have call predecessors, (25), 23 states have call successors, (25) [2022-12-13 21:27:36,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 183 transitions. [2022-12-13 21:27:36,414 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 183 transitions. Word has length 68 [2022-12-13 21:27:36,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:27:36,414 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 183 transitions. [2022-12-13 21:27:36,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-12-13 21:27:36,415 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 183 transitions. [2022-12-13 21:27:36,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-13 21:27:36,415 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:27:36,415 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:27:36,423 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 21:27:36,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-13 21:27:36,617 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:27:36,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:27:36,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2006675293, now seen corresponding path program 1 times [2022-12-13 21:27:36,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:27:36,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860872765] [2022-12-13 21:27:36,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:27:36,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:27:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:38,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:27:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:38,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:27:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:38,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:27:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:38,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:27:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:38,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:27:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:38,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 21:27:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:38,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 21:27:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:38,857 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 21:27:38,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:27:38,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860872765] [2022-12-13 21:27:38,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860872765] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:27:38,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081089963] [2022-12-13 21:27:38,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:27:38,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:27:38,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:27:38,858 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:27:38,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 21:27:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:39,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 2525 conjuncts, 83 conjunts are in the unsatisfiable core [2022-12-13 21:27:39,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:27:39,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:27:39,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:27:39,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-13 21:27:39,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:27:39,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:27:39,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:27:39,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-12-13 21:27:40,285 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 21:27:40,285 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 46 treesize of output 54 [2022-12-13 21:27:41,441 INFO L321 Elim1Store]: treesize reduction 16, result has 67.3 percent of original size [2022-12-13 21:27:41,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 58 [2022-12-13 21:27:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 21:27:41,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:27:42,428 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 21:27:42,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 56 treesize of output 96 [2022-12-13 21:27:42,477 INFO L321 Elim1Store]: treesize reduction 3, result has 93.6 percent of original size [2022-12-13 21:27:42,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 99 treesize of output 114 [2022-12-13 21:27:42,495 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 21:27:42,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 110 [2022-12-13 21:27:42,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081089963] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:27:42,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 21:27:42,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 49 [2022-12-13 21:27:42,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672280253] [2022-12-13 21:27:42,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 21:27:42,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-13 21:27:42,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:27:42,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-13 21:27:42,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3732, Unknown=0, NotChecked=0, Total=3906 [2022-12-13 21:27:42,869 INFO L87 Difference]: Start difference. First operand 173 states and 183 transitions. Second operand has 49 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 37 states have internal predecessors, (91), 10 states have call successors, (14), 6 states have call predecessors, (14), 10 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) [2022-12-13 21:27:46,631 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 21:27:50,661 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 21:27:53,122 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 21:27:58,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:27:58,728 INFO L93 Difference]: Finished difference Result 183 states and 191 transitions. [2022-12-13 21:27:58,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-12-13 21:27:58,729 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 37 states have internal predecessors, (91), 10 states have call successors, (14), 6 states have call predecessors, (14), 10 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) Word has length 70 [2022-12-13 21:27:58,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:27:58,729 INFO L225 Difference]: With dead ends: 183 [2022-12-13 21:27:58,729 INFO L226 Difference]: Without dead ends: 181 [2022-12-13 21:27:58,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2343 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=969, Invalid=11687, Unknown=0, NotChecked=0, Total=12656 [2022-12-13 21:27:58,732 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 295 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 4177 mSolverCounterSat, 139 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 4319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 4177 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2022-12-13 21:27:58,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 573 Invalid, 4319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 4177 Invalid, 3 Unknown, 0 Unchecked, 9.9s Time] [2022-12-13 21:27:58,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-12-13 21:27:58,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2022-12-13 21:27:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 130 states have (on average 1.0461538461538462) internal successors, (136), 132 states have internal predecessors, (136), 25 states have call successors, (25), 19 states have call predecessors, (25), 21 states have return successors, (25), 25 states have call predecessors, (25), 23 states have call successors, (25) [2022-12-13 21:27:58,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 186 transitions. [2022-12-13 21:27:58,759 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 186 transitions. Word has length 70 [2022-12-13 21:27:58,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:27:58,759 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 186 transitions. [2022-12-13 21:27:58,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 37 states have internal predecessors, (91), 10 states have call successors, (14), 6 states have call predecessors, (14), 10 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) [2022-12-13 21:27:58,760 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 186 transitions. [2022-12-13 21:27:58,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-13 21:27:58,760 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:27:58,760 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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] [2022-12-13 21:27:58,768 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 21:27:58,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 21:27:58,961 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:27:58,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:27:58,961 INFO L85 PathProgramCache]: Analyzing trace with hash -865864377, now seen corresponding path program 1 times [2022-12-13 21:27:58,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:27:58,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904988440] [2022-12-13 21:27:58,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:27:58,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:27:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:59,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:27:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:59,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:27:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:59,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:27:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:59,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:27:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:59,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:27:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:59,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 21:27:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:59,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:27:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:59,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:27:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:59,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 21:27:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:59,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 21:27:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:27:59,690 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-12-13 21:27:59,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:27:59,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904988440] [2022-12-13 21:27:59,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904988440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:27:59,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:27:59,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 21:27:59,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138481750] [2022-12-13 21:27:59,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:27:59,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 21:27:59,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:27:59,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 21:27:59,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 21:27:59,692 INFO L87 Difference]: Start difference. First operand 177 states and 186 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 21:28:00,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:28:00,097 INFO L93 Difference]: Finished difference Result 187 states and 195 transitions. [2022-12-13 21:28:00,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 21:28:00,098 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 76 [2022-12-13 21:28:00,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:28:00,098 INFO L225 Difference]: With dead ends: 187 [2022-12-13 21:28:00,098 INFO L226 Difference]: Without dead ends: 185 [2022-12-13 21:28:00,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-12-13 21:28:00,099 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 43 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:28:00,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 157 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 21:28:00,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-12-13 21:28:00,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-12-13 21:28:00,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 136 states have (on average 1.0441176470588236) internal successors, (142), 138 states have internal predecessors, (142), 25 states have call successors, (25), 21 states have call predecessors, (25), 23 states have return successors, (25), 25 states have call predecessors, (25), 23 states have call successors, (25) [2022-12-13 21:28:00,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 192 transitions. [2022-12-13 21:28:00,126 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 192 transitions. Word has length 76 [2022-12-13 21:28:00,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:28:00,126 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 192 transitions. [2022-12-13 21:28:00,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 21:28:00,126 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 192 transitions. [2022-12-13 21:28:00,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-12-13 21:28:00,127 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:28:00,127 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:28:00,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 21:28:00,127 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:28:00,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:28:00,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1177486125, now seen corresponding path program 1 times [2022-12-13 21:28:00,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:28:00,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081183307] [2022-12-13 21:28:00,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:28:00,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:28:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:00,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:28:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:00,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:28:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:00,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:28:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:00,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:28:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:00,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:28:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:00,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 21:28:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:00,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:28:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:00,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:28:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:00,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 21:28:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:00,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 21:28:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:00,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 21:28:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:00,805 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 21:28:00,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:28:00,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081183307] [2022-12-13 21:28:00,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081183307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:28:00,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:28:00,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 21:28:00,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293237251] [2022-12-13 21:28:00,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:28:00,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 21:28:00,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:28:00,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 21:28:00,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 21:28:00,807 INFO L87 Difference]: Start difference. First operand 185 states and 192 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-12-13 21:28:01,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:28:01,124 INFO L93 Difference]: Finished difference Result 195 states and 201 transitions. [2022-12-13 21:28:01,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 21:28:01,125 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 83 [2022-12-13 21:28:01,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:28:01,125 INFO L225 Difference]: With dead ends: 195 [2022-12-13 21:28:01,125 INFO L226 Difference]: Without dead ends: 191 [2022-12-13 21:28:01,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-12-13 21:28:01,126 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 76 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 21:28:01,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 186 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 21:28:01,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-12-13 21:28:01,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2022-12-13 21:28:01,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 142 states have internal predecessors, (146), 25 states have call successors, (25), 23 states have call predecessors, (25), 24 states have return successors, (25), 25 states have call predecessors, (25), 23 states have call successors, (25) [2022-12-13 21:28:01,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 196 transitions. [2022-12-13 21:28:01,154 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 196 transitions. Word has length 83 [2022-12-13 21:28:01,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:28:01,154 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 196 transitions. [2022-12-13 21:28:01,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-12-13 21:28:01,155 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 196 transitions. [2022-12-13 21:28:01,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-12-13 21:28:01,155 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:28:01,155 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:28:01,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 21:28:01,155 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:28:01,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:28:01,156 INFO L85 PathProgramCache]: Analyzing trace with hash 896566141, now seen corresponding path program 1 times [2022-12-13 21:28:01,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:28:01,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823131448] [2022-12-13 21:28:01,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:28:01,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:28:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:01,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:28:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:01,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:28:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:01,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:28:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:01,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:28:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:01,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:28:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:02,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 21:28:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:02,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 21:28:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:02,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 21:28:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:02,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 21:28:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:02,019 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-13 21:28:02,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:28:02,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823131448] [2022-12-13 21:28:02,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823131448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:28:02,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:28:02,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 21:28:02,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378501039] [2022-12-13 21:28:02,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:28:02,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 21:28:02,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:28:02,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 21:28:02,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-12-13 21:28:02,021 INFO L87 Difference]: Start difference. First operand 191 states and 196 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 8 states have internal predecessors, (38), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-12-13 21:28:02,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:28:02,417 INFO L93 Difference]: Finished difference Result 197 states and 201 transitions. [2022-12-13 21:28:02,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 21:28:02,418 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 8 states have internal predecessors, (38), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 82 [2022-12-13 21:28:02,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:28:02,418 INFO L225 Difference]: With dead ends: 197 [2022-12-13 21:28:02,418 INFO L226 Difference]: Without dead ends: 193 [2022-12-13 21:28:02,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-12-13 21:28:02,419 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 79 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 21:28:02,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 132 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 21:28:02,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-12-13 21:28:02,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 148. [2022-12-13 21:28:02,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 113 states have (on average 1.0353982300884956) internal successors, (117), 114 states have internal predecessors, (117), 17 states have call successors, (17), 16 states have call predecessors, (17), 17 states have return successors, (18), 17 states have call predecessors, (18), 16 states have call successors, (18) [2022-12-13 21:28:02,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 152 transitions. [2022-12-13 21:28:02,440 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 152 transitions. Word has length 82 [2022-12-13 21:28:02,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:28:02,440 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 152 transitions. [2022-12-13 21:28:02,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 8 states have internal predecessors, (38), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-12-13 21:28:02,440 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2022-12-13 21:28:02,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-12-13 21:28:02,441 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:28:02,441 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:28:02,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 21:28:02,441 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:28:02,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:28:02,441 INFO L85 PathProgramCache]: Analyzing trace with hash -852279920, now seen corresponding path program 1 times [2022-12-13 21:28:02,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:28:02,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852772584] [2022-12-13 21:28:02,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:28:02,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:28:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:03,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:28:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:03,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:28:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:03,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:28:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:03,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:28:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:03,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:28:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:03,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 21:28:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:03,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 21:28:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:03,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 21:28:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:03,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 21:28:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:03,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 21:28:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:03,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 21:28:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:03,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-12-13 21:28:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:03,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 21:28:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:03,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 21:28:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:03,980 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-12-13 21:28:03,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:28:03,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852772584] [2022-12-13 21:28:03,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852772584] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:28:03,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760136068] [2022-12-13 21:28:03,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:28:03,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 21:28:03,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:28:03,981 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 21:28:03,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 21:28:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:04,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 2607 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-13 21:28:04,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 21:28:04,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:28:04,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 21:28:04,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-12-13 21:28:05,275 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 21:28:05,275 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 34 treesize of output 14 [2022-12-13 21:28:05,301 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-12-13 21:28:05,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 21:28:05,548 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 3036 treesize of output 2940 [2022-12-13 21:28:06,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760136068] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 21:28:06,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 21:28:06,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-12-13 21:28:06,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534254138] [2022-12-13 21:28:06,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 21:28:06,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 21:28:06,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:28:06,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 21:28:06,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=690, Unknown=0, NotChecked=0, Total=756 [2022-12-13 21:28:06,286 INFO L87 Difference]: Start difference. First operand 148 states and 152 transitions. Second operand has 24 states, 22 states have (on average 3.772727272727273) internal successors, (83), 18 states have internal predecessors, (83), 10 states have call successors, (28), 5 states have call predecessors, (28), 6 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2022-12-13 21:28:21,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 21:28:23,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 21:28:27,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 21:28:31,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 21:28:35,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 21:28:36,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 21:28:37,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 21:28:38,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 21:28:41,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 21:28:42,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 21:28:43,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 21:28:45,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 21:28:47,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:28:47,148 INFO L93 Difference]: Finished difference Result 203 states and 206 transitions. [2022-12-13 21:28:47,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 21:28:47,148 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.772727272727273) internal successors, (83), 18 states have internal predecessors, (83), 10 states have call successors, (28), 5 states have call predecessors, (28), 6 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) Word has length 100 [2022-12-13 21:28:47,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:28:47,149 INFO L225 Difference]: With dead ends: 203 [2022-12-13 21:28:47,149 INFO L226 Difference]: Without dead ends: 109 [2022-12-13 21:28:47,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 167 SyntacticMatches, 13 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=257, Invalid=1997, Unknown=2, NotChecked=0, Total=2256 [2022-12-13 21:28:47,150 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 213 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 75 mSolverCounterUnsat, 53 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 53 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.1s IncrementalHoareTripleChecker+Time [2022-12-13 21:28:47,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 280 Invalid, 1520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1392 Invalid, 53 Unknown, 0 Unchecked, 35.1s Time] [2022-12-13 21:28:47,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-12-13 21:28:47,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-12-13 21:28:47,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 80 states have (on average 1.0) internal successors, (80), 80 states have internal predecessors, (80), 15 states have call successors, (15), 14 states have call predecessors, (15), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-12-13 21:28:47,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2022-12-13 21:28:47,168 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 100 [2022-12-13 21:28:47,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:28:47,169 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2022-12-13 21:28:47,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.772727272727273) internal successors, (83), 18 states have internal predecessors, (83), 10 states have call successors, (28), 5 states have call predecessors, (28), 6 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2022-12-13 21:28:47,169 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2022-12-13 21:28:47,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-13 21:28:47,169 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 21:28:47,169 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 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, 1, 1, 1, 1, 1, 1] [2022-12-13 21:28:47,177 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 21:28:47,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 21:28:47,370 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 21:28:47,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:28:47,370 INFO L85 PathProgramCache]: Analyzing trace with hash 534230128, now seen corresponding path program 1 times [2022-12-13 21:28:47,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:28:47,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074595897] [2022-12-13 21:28:47,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:28:47,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:28:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:49,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 21:28:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:49,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:28:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:49,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 21:28:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:49,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 21:28:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:49,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 21:28:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:49,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 21:28:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:49,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 21:28:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:49,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 21:28:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:49,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 21:28:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:49,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 21:28:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:49,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 21:28:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:49,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 21:28:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:49,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 21:28:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:49,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-12-13 21:28:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:28:49,724 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-12-13 21:28:49,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:28:49,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074595897] [2022-12-13 21:28:49,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074595897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:28:49,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:28:49,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-12-13 21:28:49,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340058796] [2022-12-13 21:28:49,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:28:49,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 21:28:49,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:28:49,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 21:28:49,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2022-12-13 21:28:49,726 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 12 states have internal predecessors, (46), 7 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-12-13 21:28:50,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 21:28:50,342 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2022-12-13 21:28:50,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 21:28:50,343 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 12 states have internal predecessors, (46), 7 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Word has length 112 [2022-12-13 21:28:50,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 21:28:50,343 INFO L225 Difference]: With dead ends: 109 [2022-12-13 21:28:50,343 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 21:28:50,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2022-12-13 21:28:50,344 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 78 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 21:28:50,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 175 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 21:28:50,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 21:28:50,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 21:28:50,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:28:50,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 21:28:50,345 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112 [2022-12-13 21:28:50,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 21:28:50,345 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 21:28:50,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 12 states have internal predecessors, (46), 7 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-12-13 21:28:50,345 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 21:28:50,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 21:28:50,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 21:28:50,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 21:28:50,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 21:28:58,552 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-12-13 21:28:58,553 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 6882 6887) the Hoare annotation is: (or (forall ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21| Int)) (not (let ((.cse0 (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21|) 0))) (<= .cse0 (+ 18446744073709551615 (* (div (+ (- 1) .cse0) 18446744073709551616) 18446744073709551616)))))) (forall ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_6| Int)) (not (let ((.cse1 (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_6|) 0))) (<= .cse1 (* 18446744073709551616 (div .cse1 18446744073709551616)))))) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (forall ((|v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24| Int) (|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse2 (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (or (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24|) 8) .cse2)) (= .cse2 0))))) [2022-12-13 21:28:58,553 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-12-13 21:28:58,553 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-12-13 21:28:58,553 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (or (forall ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21| Int)) (not (let ((.cse0 (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21|) 0))) (<= .cse0 (+ 18446744073709551615 (* (div (+ (- 1) .cse0) 18446744073709551616) 18446744073709551616)))))) (forall ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_6| Int)) (not (let ((.cse1 (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_6|) 0))) (<= .cse1 (* 18446744073709551616 (div .cse1 18446744073709551616)))))) (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (forall ((|v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24| Int) (|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse2 (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (or (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24|) 8) .cse2)) (= .cse2 0))))) [2022-12-13 21:28:58,553 INFO L899 garLoopResultBuilder]: For program point L7377-3(line 7377) no Hoare annotation was computed. [2022-12-13 21:28:58,553 INFO L899 garLoopResultBuilder]: For program point L7377-1(line 7377) no Hoare annotation was computed. [2022-12-13 21:28:58,553 INFO L899 garLoopResultBuilder]: For program point L7377(lines 7377 7380) no Hoare annotation was computed. [2022-12-13 21:28:58,553 INFO L899 garLoopResultBuilder]: For program point L7377-7(lines 7377 7380) no Hoare annotation was computed. [2022-12-13 21:28:58,553 INFO L899 garLoopResultBuilder]: For program point L7377-6(lines 7377 7378) no Hoare annotation was computed. [2022-12-13 21:28:58,554 INFO L899 garLoopResultBuilder]: For program point L7377-4(lines 7377 7378) no Hoare annotation was computed. [2022-12-13 21:28:58,554 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7375 7381) the Hoare annotation is: true [2022-12-13 21:28:58,554 INFO L899 garLoopResultBuilder]: For program point L7377-11(lines 7377 7380) no Hoare annotation was computed. [2022-12-13 21:28:58,554 INFO L899 garLoopResultBuilder]: For program point L7377-9(lines 7377 7380) no Hoare annotation was computed. [2022-12-13 21:28:58,554 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7375 7381) no Hoare annotation was computed. [2022-12-13 21:28:58,554 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7375 7381) no Hoare annotation was computed. [2022-12-13 21:28:58,554 INFO L899 garLoopResultBuilder]: For program point L7380-2(line 7380) no Hoare annotation was computed. [2022-12-13 21:28:58,554 INFO L899 garLoopResultBuilder]: For program point L7380(line 7380) no Hoare annotation was computed. [2022-12-13 21:28:58,554 INFO L899 garLoopResultBuilder]: For program point L7380-6(line 7380) no Hoare annotation was computed. [2022-12-13 21:28:58,554 INFO L899 garLoopResultBuilder]: For program point L7380-4(line 7380) no Hoare annotation was computed. [2022-12-13 21:28:58,554 INFO L899 garLoopResultBuilder]: For program point L7380-3(line 7380) no Hoare annotation was computed. [2022-12-13 21:28:58,554 INFO L899 garLoopResultBuilder]: For program point L7380-8(line 7380) no Hoare annotation was computed. [2022-12-13 21:28:58,554 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-12-13 21:28:58,554 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 210 212) the Hoare annotation is: true [2022-12-13 21:28:58,554 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-12-13 21:28:58,554 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-12-13 21:28:58,554 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_from_arrayFINAL(lines 8203 8216) no Hoare annotation was computed. [2022-12-13 21:28:58,554 INFO L899 garLoopResultBuilder]: For program point L8204-1(line 8204) no Hoare annotation was computed. [2022-12-13 21:28:58,555 INFO L895 garLoopResultBuilder]: At program point L8204(line 8204) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24| Int) (|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse0 (select (select |old(#memory_$Pointer$.base)| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (or (= 0 .cse0) (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24|) 8) .cse0))))) (forall ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21| Int)) (not (let ((.cse1 (select (select |old(#memory_int)| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21|) 0))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))))) (= |aws_byte_buf_from_array_#in~bytes.base| 0) (and (= aws_byte_buf_from_array_~bytes.offset |aws_byte_buf_from_array_#in~bytes.offset|) (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= aws_byte_buf_from_array_~len |aws_byte_buf_from_array_#in~len|) (= aws_byte_buf_from_array_~bytes.base |aws_byte_buf_from_array_#in~bytes.base|)) (forall ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_14| Int)) (not (let ((.cse2 (select (select |old(#memory_int)| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_14|) 0))) (<= .cse2 (* 18446744073709551616 (div .cse2 18446744073709551616))))))) [2022-12-13 21:28:58,555 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 8203 8216) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (forall ((|v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24| Int) (|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse0 (select (select |old(#memory_$Pointer$.base)| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (or (= 0 .cse0) (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24|) 8) .cse0))))) (forall ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21| Int)) (not (let ((.cse1 (select (select |old(#memory_int)| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21|) 0))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))))) (= |aws_byte_buf_from_array_#in~bytes.base| 0) (forall ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_14| Int)) (not (let ((.cse2 (select (select |old(#memory_int)| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_14|) 0))) (<= .cse2 (* 18446744073709551616 (div .cse2 18446744073709551616))))))) [2022-12-13 21:28:58,555 INFO L895 garLoopResultBuilder]: At program point L8214(line 8214) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24| Int) (|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse0 (select (select |old(#memory_$Pointer$.base)| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (or (= 0 .cse0) (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24|) 8) .cse0))))) (forall ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21| Int)) (not (let ((.cse1 (select (select |old(#memory_int)| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21|) 0))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))))) (= |aws_byte_buf_from_array_#in~bytes.base| 0) (let ((.cse7 (select |#memory_$Pointer$.offset| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse9 (select |#memory_$Pointer$.base| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse12 (+ |aws_byte_buf_from_array_~#buf~1.offset| 8))) (let ((.cse10 (select .cse9 .cse12)) (.cse11 (select |#memory_int| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse4 (select .cse7 .cse12))) (let ((.cse3 (= .cse4 0)) (.cse8 (+ |aws_byte_buf_from_array_~#buf~1.offset| 24)) (.cse6 (select .cse11 |aws_byte_buf_from_array_~#buf~1.offset|)) (.cse2 (= .cse10 0)) (.cse5 (select .cse11 (+ |aws_byte_buf_from_array_~#buf~1.offset| 16)))) (and (= aws_byte_buf_from_array_~bytes.offset |aws_byte_buf_from_array_#in~bytes.offset|) (or .cse2 (< 0 (mod |aws_byte_buf_from_array_#in~len| 18446744073709551616))) (or .cse3 (= .cse4 |aws_byte_buf_from_array_#in~bytes.offset|)) (= .cse5 .cse6) (= (select .cse7 .cse8) 0) (or .cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (= (select .cse9 .cse8) 0) (= |aws_byte_buf_from_array_~#buf~1.offset| 0) (not (= |aws_byte_buf_from_array_~#buf~1.base| 0)) (= |aws_byte_buf_from_array_#in~len| .cse6) (= aws_byte_buf_from_array_~len |aws_byte_buf_from_array_#in~len|) (or .cse2 (= .cse10 |aws_byte_buf_from_array_#in~bytes.base|)) (= aws_byte_buf_from_array_~bytes.base |aws_byte_buf_from_array_#in~bytes.base|) (or (not .cse2) (<= .cse5 (* 18446744073709551616 (div .cse5 18446744073709551616)))))))) (forall ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_14| Int)) (not (let ((.cse13 (select (select |old(#memory_int)| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_14|) 0))) (<= .cse13 (* 18446744073709551616 (div .cse13 18446744073709551616))))))) [2022-12-13 21:28:58,555 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_from_arrayEXIT(lines 8203 8216) no Hoare annotation was computed. [2022-12-13 21:28:58,555 INFO L899 garLoopResultBuilder]: For program point L8214-2(line 8214) no Hoare annotation was computed. [2022-12-13 21:28:58,556 INFO L895 garLoopResultBuilder]: At program point L8214-1(line 8214) the Hoare annotation is: (let ((.cse18 (select |#memory_int| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse17 (select |#memory_$Pointer$.offset| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse19 (+ |aws_byte_buf_from_array_~#buf~1.offset| 8))) (let ((.cse16 (+ |aws_byte_buf_from_array_~#buf~1.offset| 24)) (.cse3 (select .cse17 .cse19)) (.cse6 (select .cse18 |aws_byte_buf_from_array_~#buf~1.offset|)) (.cse15 (select |#memory_$Pointer$.base| |aws_byte_buf_from_array_~#buf~1.base|))) (let ((.cse9 (select .cse15 .cse19)) (.cse4 (= (select .cse18 (+ |aws_byte_buf_from_array_~#buf~1.offset| 16)) .cse6)) (.cse2 (= .cse3 0)) (.cse5 (= (select .cse17 .cse16) 0)) (.cse7 (= (select .cse15 .cse16) 0)) (.cse8 (= |aws_byte_buf_from_array_~#buf~1.offset| 0)) (.cse10 (not (= |aws_byte_buf_from_array_~#buf~1.base| 0))) (.cse11 (= |aws_byte_buf_from_array_#in~len| .cse6)) (.cse12 (= aws_byte_buf_from_array_~len |aws_byte_buf_from_array_#in~len|)) (.cse13 (= aws_byte_buf_from_array_~bytes.base |aws_byte_buf_from_array_#in~bytes.base|))) (or (forall ((|v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24| Int) (|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse0 (select (select |old(#memory_$Pointer$.base)| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (or (= 0 .cse0) (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24|) 8) .cse0))))) (forall ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21| Int)) (not (let ((.cse1 (select (select |old(#memory_int)| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21|) 0))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))))) (and (= aws_byte_buf_from_array_~bytes.offset |aws_byte_buf_from_array_#in~bytes.offset|) (or .cse2 (= .cse3 |aws_byte_buf_from_array_#in~bytes.offset|)) .cse4 .cse5 (not (= (mod .cse6 18446744073709551616) 0)) (<= |aws_byte_buf_from_array_#t~ret1045| 1) .cse7 (<= 1 |aws_byte_buf_from_array_#t~ret1045|) .cse8 (= .cse9 |aws_byte_buf_from_array_#in~bytes.base|) .cse10 .cse11 .cse12 .cse13) (= |aws_byte_buf_from_array_#in~bytes.base| 0) (and (= .cse9 0) (= |aws_byte_buf_from_array_#t~ret1045| 1) .cse4 .cse2 .cse5 .cse7 (<= 0 (+ |aws_byte_buf_from_array_#in~len| (* (div (- |aws_byte_buf_from_array_#in~len|) 18446744073709551616) 18446744073709551616))) .cse8 .cse10 .cse11 .cse12 .cse13) (forall ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_14| Int)) (not (let ((.cse14 (select (select |old(#memory_int)| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_14|) 0))) (<= .cse14 (* 18446744073709551616 (div .cse14 18446744073709551616)))))))))) [2022-12-13 21:28:58,556 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-12-13 21:28:58,556 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-12-13 21:28:58,556 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 266) the Hoare annotation is: true [2022-12-13 21:28:58,556 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 21:28:58,556 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-12-13 21:28:58,556 INFO L899 garLoopResultBuilder]: For program point L8962-1(line 8962) no Hoare annotation was computed. [2022-12-13 21:28:58,556 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-12-13 21:28:58,556 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: (let ((.cse23 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse25 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse26 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (let ((.cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0)) (.cse2 (select .cse25 .cse26)) (.cse1 (= (select .cse23 .cse26) 0))) (let ((.cse0 (and .cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse2) .cse1))) (and (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (or .cse0 (and .cse1 (= .cse2 0))) .cse3 (or .cse0 (and (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1205#1.base| 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1205#1.offset| 0))) (let ((.cse21 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse17 (select .cse21 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))) (.cse24 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse4 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse5 (= (select .cse25 .cse24) 0)) (.cse6 (= (select .cse23 .cse24) 0)) (.cse7 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_77| Int)) (let ((.cse22 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_77|))) (let ((.cse19 (select .cse22 16)) (.cse20 (select .cse22 0))) (and (= .cse19 .cse20) (= .cse19 .cse17) (= .cse20 (select .cse21 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))))))) (.cse8 (= .cse17 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse9 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse11 (or (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (and (not (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))) (= (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 8) 0))) (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))))) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse13 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (+ 36028797018963967 (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616)))) (.cse14 (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)))) (or (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse10 (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (and (not (= .cse10 0)) (= .cse10 .cse2)))) .cse11 .cse12 .cse13 .cse14) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_49| Int)) (let ((.cse18 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_49|))) (let ((.cse16 (select .cse18 16)) (.cse15 (select .cse18 0))) (and (= .cse15 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= (mod .cse16 18446744073709551616) 0) (= .cse17 .cse16) (= (mod .cse15 18446744073709551616) 0))))) .cse11 .cse12 .cse13 .cse14))))) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))))) [2022-12-13 21:28:58,557 INFO L895 garLoopResultBuilder]: At program point L8971(lines 8971 8973) the Hoare annotation is: (let ((.cse25 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse26 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (let ((.cse1 (select .cse25 .cse26)) (.cse23 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse0 (= (select .cse23 .cse26) 0)) (.cse2 (let ((.cse21 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse17 (select .cse21 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))) (.cse24 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse3 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse4 (= (select .cse25 .cse24) 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1204#1.offset| 0)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1204#1.base| 0)) (.cse7 (= (select .cse23 .cse24) 0)) (.cse8 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_77| Int)) (let ((.cse22 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_77|))) (let ((.cse19 (select .cse22 16)) (.cse20 (select .cse22 0))) (and (= .cse19 .cse20) (= .cse19 .cse17) (= .cse20 (select .cse21 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))))))) (.cse9 (= .cse17 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse10 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse12 (or (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (and (not (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))) (= (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 8) 0))) (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))))) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse14 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (+ 36028797018963967 (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616))))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse11 (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (and (not (= .cse11 0)) (= .cse11 .cse1)))) .cse12 .cse13 .cse14) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_49| Int)) (let ((.cse18 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_49|))) (let ((.cse16 (select .cse18 16)) (.cse15 (select .cse18 0))) (and (= .cse15 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= (mod .cse16 18446744073709551616) 0) (= .cse17 .cse16) (= (mod .cse15 18446744073709551616) 0))))) .cse12 .cse13 .cse14))))))) (or (and .cse0 (= .cse1 0) .cse2) (and (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse1) .cse0 .cse2))))) [2022-12-13 21:28:58,557 INFO L899 garLoopResultBuilder]: For program point L8971-1(lines 8971 8973) no Hoare annotation was computed. [2022-12-13 21:28:58,557 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 21:28:58,557 INFO L895 garLoopResultBuilder]: At program point L8965(line 8965) the Hoare annotation is: (and (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21| Int)) (let ((.cse0 (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21|) 0))) (<= .cse0 (+ 18446744073709551615 (* (div (+ (- 1) .cse0) 18446744073709551616) 18446744073709551616))))) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24| Int) (|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse1 (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (and (not (= .cse1 0)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24|) 8) .cse1)))) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_6| Int)) (let ((.cse2 (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_6|) 0))) (<= .cse2 (* 18446744073709551616 (div .cse2 18446744073709551616))))) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0) (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (+ 36028797018963967 (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616)))) [2022-12-13 21:28:58,557 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(line 8978) the Hoare annotation is: true [2022-12-13 21:28:58,557 INFO L899 garLoopResultBuilder]: For program point L8965-1(line 8965) no Hoare annotation was computed. [2022-12-13 21:28:58,557 INFO L895 garLoopResultBuilder]: At program point L8969(line 8969) the Hoare annotation is: (let ((.cse24 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse25 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (let ((.cse2 (select .cse24 .cse25)) (.cse22 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse0 (= (select .cse22 .cse25) 0)) (.cse1 (let ((.cse20 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse11 (select .cse20 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))) (.cse23 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse3 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse4 (= (select .cse24 .cse23) 0)) (.cse5 (= (select .cse22 .cse23) 0)) (.cse6 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_77| Int)) (let ((.cse21 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_77|))) (let ((.cse18 (select .cse21 16)) (.cse19 (select .cse21 0))) (and (= .cse18 .cse19) (= .cse18 .cse11) (= .cse19 (select .cse20 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))))))) (.cse7 (= .cse11 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse13 (or (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (and (not (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))) (= (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 8) 0))) (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))))) (.cse14 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1202#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse15 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse16 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (+ 36028797018963967 (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616))))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_49| Int)) (let ((.cse12 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_49|))) (let ((.cse10 (select .cse12 16)) (.cse9 (select .cse12 0))) (and (= .cse9 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= (mod .cse10 18446744073709551616) 0) (= .cse11 .cse10) (= (mod .cse9 18446744073709551616) 0))))) .cse13 .cse14 .cse15 .cse16) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse17 (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (and (not (= .cse17 0)) (= .cse17 .cse2)))) .cse13 .cse14 .cse15 .cse16))))))) (or (and .cse0 .cse1 (= .cse2 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse2) .cse0 .cse1))))) [2022-12-13 21:28:58,558 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-12-13 21:28:58,558 INFO L899 garLoopResultBuilder]: For program point L8969-1(line 8969) no Hoare annotation was computed. [2022-12-13 21:28:58,558 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: (let ((.cse23 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse25 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse26 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (let ((.cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0)) (.cse2 (select .cse25 .cse26)) (.cse1 (= (select .cse23 .cse26) 0))) (let ((.cse0 (and .cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse2) .cse1))) (and (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (or .cse0 (and .cse1 (= .cse2 0))) .cse3 (or .cse0 (and (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1205#1.base| 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1205#1.offset| 0))) (let ((.cse21 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse17 (select .cse21 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))) (.cse24 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse4 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse5 (= (select .cse25 .cse24) 0)) (.cse6 (= (select .cse23 .cse24) 0)) (.cse7 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_77| Int)) (let ((.cse22 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_77|))) (let ((.cse19 (select .cse22 16)) (.cse20 (select .cse22 0))) (and (= .cse19 .cse20) (= .cse19 .cse17) (= .cse20 (select .cse21 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))))))) (.cse8 (= .cse17 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse9 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse11 (or (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (and (not (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))) (= (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 8) 0))) (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))))) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse13 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (+ 36028797018963967 (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616)))) (.cse14 (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)))) (or (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse10 (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (and (not (= .cse10 0)) (= .cse10 .cse2)))) .cse11 .cse12 .cse13 .cse14) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_49| Int)) (let ((.cse18 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_49|))) (let ((.cse16 (select .cse18 16)) (.cse15 (select .cse18 0))) (and (= .cse15 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= (mod .cse16 18446744073709551616) 0) (= .cse17 .cse16) (= (mod .cse15 18446744073709551616) 0))))) .cse11 .cse12 .cse13 .cse14))))) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))))) [2022-12-13 21:28:58,558 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 21:28:58,558 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 21:28:58,558 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-12-13 21:28:58,558 INFO L899 garLoopResultBuilder]: For program point L8959(lines 8959 8977) no Hoare annotation was computed. [2022-12-13 21:28:58,558 INFO L899 garLoopResultBuilder]: For program point L8974-2(lines 8974 8976) no Hoare annotation was computed. [2022-12-13 21:28:58,559 INFO L895 garLoopResultBuilder]: At program point L8970(line 8970) the Hoare annotation is: (let ((.cse25 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse4 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (let ((.cse1 (select .cse25 .cse4)) (.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse0 (let ((.cse22 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse13 (select .cse22 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))) (.cse24 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse5 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse6 (= (select .cse25 .cse24) 0)) (.cse7 (= (select .cse3 .cse24) 0)) (.cse8 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_77| Int)) (let ((.cse23 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_77|))) (let ((.cse20 (select .cse23 16)) (.cse21 (select .cse23 0))) (and (= .cse20 .cse21) (= .cse20 .cse13) (= .cse21 (select .cse22 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))))))) (.cse9 (= .cse13 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse10 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse15 (or (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (and (not (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))) (= (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 8) 0))) (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))))) (.cse16 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1203#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse17 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse18 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (+ 36028797018963967 (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616))))) (or (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_49| Int)) (let ((.cse14 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_49|))) (let ((.cse12 (select .cse14 16)) (.cse11 (select .cse14 0))) (and (= .cse11 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= (mod .cse12 18446744073709551616) 0) (= .cse13 .cse12) (= (mod .cse11 18446744073709551616) 0))))) .cse15 .cse16 .cse17 .cse18) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse19 (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (and (not (= .cse19 0)) (= .cse19 .cse1)))) .cse15 .cse16 .cse17 .cse18)))))) (.cse2 (= (select .cse3 .cse4) 0))) (or (and .cse0 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse1) .cse2) (and .cse0 .cse2 (= .cse1 0)))))) [2022-12-13 21:28:58,559 INFO L899 garLoopResultBuilder]: For program point L8974(lines 8974 8976) no Hoare annotation was computed. [2022-12-13 21:28:58,559 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: (let ((.cse23 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse25 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse26 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (let ((.cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0)) (.cse2 (select .cse25 .cse26)) (.cse1 (= (select .cse23 .cse26) 0))) (let ((.cse0 (and .cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse2) .cse1))) (and (= |ULTIMATE.start_assert_bytes_match_#t~mem585#1| |ULTIMATE.start_assert_bytes_match_#t~mem584#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (or .cse0 (and .cse1 (= .cse2 0))) .cse3 (or .cse0 (and (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1205#1.base| 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1205#1.offset| 0))) (let ((.cse21 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse17 (select .cse21 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))) (.cse24 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse4 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse5 (= (select .cse25 .cse24) 0)) (.cse6 (= (select .cse23 .cse24) 0)) (.cse7 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_77| Int)) (let ((.cse22 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_77|))) (let ((.cse19 (select .cse22 16)) (.cse20 (select .cse22 0))) (and (= .cse19 .cse20) (= .cse19 .cse17) (= .cse20 (select .cse21 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))))))) (.cse8 (= .cse17 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse9 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse11 (or (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (and (not (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))) (= (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 8) 0))) (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))))) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse13 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (+ 36028797018963967 (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616)))) (.cse14 (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)))) (or (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse10 (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (and (not (= .cse10 0)) (= .cse10 .cse2)))) .cse11 .cse12 .cse13 .cse14) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_49| Int)) (let ((.cse18 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_49|))) (let ((.cse16 (select .cse18 16)) (.cse15 (select .cse18 0))) (and (= .cse15 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= (mod .cse16 18446744073709551616) 0) (= .cse17 .cse16) (= (mod .cse15 18446744073709551616) 0))))) .cse11 .cse12 .cse13 .cse14))))) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))))) [2022-12-13 21:28:58,559 INFO L895 garLoopResultBuilder]: At program point L8962(line 8962) the Hoare annotation is: (and (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21| Int)) (let ((.cse0 (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21|) 0))) (<= .cse0 (+ 18446744073709551615 (* (div (+ (- 1) .cse0) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24| Int) (|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse1 (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (and (not (= .cse1 0)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24|) 8) .cse1)))) (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_6| Int)) (let ((.cse2 (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_6|) 0))) (<= .cse2 (* 18446744073709551616 (div .cse2 18446744073709551616)))))) [2022-12-13 21:28:58,559 INFO L899 garLoopResultBuilder]: For program point L8970-1(line 8970) no Hoare annotation was computed. [2022-12-13 21:28:58,559 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: (let ((.cse23 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse25 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse26 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (let ((.cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0)) (.cse2 (select .cse25 .cse26)) (.cse1 (= (select .cse23 .cse26) 0))) (let ((.cse0 (and .cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse2) .cse1))) (and (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (or .cse0 (and .cse1 (= .cse2 0))) .cse3 (or .cse0 (and (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1205#1.base| 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1205#1.offset| 0))) (let ((.cse21 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse17 (select .cse21 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))) (.cse24 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse4 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse5 (= (select .cse25 .cse24) 0)) (.cse6 (= (select .cse23 .cse24) 0)) (.cse7 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_77| Int)) (let ((.cse22 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_77|))) (let ((.cse19 (select .cse22 16)) (.cse20 (select .cse22 0))) (and (= .cse19 .cse20) (= .cse19 .cse17) (= .cse20 (select .cse21 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))))))) (.cse8 (= .cse17 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse9 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse11 (or (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (and (not (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))) (= (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 8) 0))) (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))))) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse13 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (+ 36028797018963967 (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616)))) (.cse14 (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)))) (or (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse10 (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (and (not (= .cse10 0)) (= .cse10 .cse2)))) .cse11 .cse12 .cse13 .cse14) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_49| Int)) (let ((.cse18 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_49|))) (let ((.cse16 (select .cse18 16)) (.cse15 (select .cse18 0))) (and (= .cse15 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= (mod .cse16 18446744073709551616) 0) (= .cse17 .cse16) (= (mod .cse15 18446744073709551616) 0))))) .cse11 .cse12 .cse13 .cse14))))) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))))) [2022-12-13 21:28:58,560 INFO L895 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: (let ((.cse20 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse18 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse11 (select .cse20 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))) (.cse19 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse17 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse21 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (= (select .cse17 .cse21) 0)) (.cse1 (= (select .cse19 .cse21) 0)) (.cse5 (select .cse20 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) (.cse2 (= .cse11 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse3 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse4 (= (select .cse19 .cse18) 0)) (.cse7 (select .cse17 .cse18)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0))) (or (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 (= .cse5 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) .cse6 (= .cse7 0) (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_40| Int)) (let ((.cse8 (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_40|) 0))) (and (<= .cse8 (* 18446744073709551616 (div .cse8 18446744073709551616))) (= .cse5 .cse8))))) (and .cse0 .cse1 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_77| Int)) (let ((.cse12 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_77|))) (let ((.cse9 (select .cse12 16)) (.cse10 (select .cse12 0))) (and (= .cse9 .cse10) (= .cse9 .cse11) (= .cse10 .cse5))))) (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_65| Int)) (let ((.cse15 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_65|))) (let ((.cse14 (select .cse15 0)) (.cse13 (select .cse15 16))) (and (= .cse11 .cse13) (not (= (mod .cse14 18446744073709551616) 0)) (= .cse14 .cse13))))) .cse2 .cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse7) .cse4 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse16 (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (and (not (= .cse16 0)) (= .cse16 .cse7)))) .cse6 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (+ 36028797018963967 (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616)))))))) [2022-12-13 21:28:58,560 INFO L895 garLoopResultBuilder]: At program point L8968-1(line 8968) the Hoare annotation is: (let ((.cse25 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse26 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (let ((.cse2 (select .cse25 .cse26)) (.cse23 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse0 (= (select .cse23 .cse26) 0)) (.cse1 (let ((.cse21 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse12 (select .cse21 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))) (.cse24 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse3 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse4 (= (select .cse25 .cse24) 0)) (.cse5 (= (select .cse23 .cse24) 0)) (.cse6 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_77| Int)) (let ((.cse22 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_77|))) (let ((.cse19 (select .cse22 16)) (.cse20 (select .cse22 0))) (and (= .cse19 .cse20) (= .cse19 .cse12) (= .cse20 (select .cse21 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))))))) (.cse7 (= .cse12 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse8 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~ret1201#1| 1)) (.cse9 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse14 (or (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (and (not (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))) (= (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 8) 0))) (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))))) (.cse15 (<= 1 |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~ret1201#1|)) (.cse16 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse17 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (+ 36028797018963967 (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616))))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_49| Int)) (let ((.cse13 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_49|))) (let ((.cse11 (select .cse13 16)) (.cse10 (select .cse13 0))) (and (= .cse10 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= (mod .cse11 18446744073709551616) 0) (= .cse12 .cse11) (= (mod .cse10 18446744073709551616) 0))))) .cse14 .cse15 .cse16 .cse17) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse18 (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (and (not (= .cse18 0)) (= .cse18 .cse2)))) .cse14 .cse15 .cse16 .cse17))))))) (or (and .cse0 .cse1 (= .cse2 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse2) .cse0 .cse1))))) [2022-12-13 21:28:58,560 INFO L899 garLoopResultBuilder]: For program point L8968-2(line 8968) no Hoare annotation was computed. [2022-12-13 21:28:58,560 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-12-13 21:28:58,560 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-12-13 21:28:58,560 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-12-13 21:28:58,560 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-12-13 21:28:58,560 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-12-13 21:28:58,560 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 222 224) the Hoare annotation is: true [2022-12-13 21:28:58,560 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-12-13 21:28:58,563 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:28:58,564 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 21:28:58,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:28:58 BoogieIcfgContainer [2022-12-13 21:28:58,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 21:28:58,570 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 21:28:58,570 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 21:28:58,570 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 21:28:58,571 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:25:54" (3/4) ... [2022-12-13 21:28:58,573 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 21:28:58,577 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-12-13 21:28:58,577 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_from_array [2022-12-13 21:28:58,577 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-12-13 21:28:58,577 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2022-12-13 21:28:58,577 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-12-13 21:28:58,577 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-12-13 21:28:58,585 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 120 nodes and edges [2022-12-13 21:28:58,585 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2022-12-13 21:28:58,586 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2022-12-13 21:28:58,586 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-12-13 21:28:58,586 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-12-13 21:28:58,587 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-12-13 21:28:58,587 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 21:28:58,588 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 21:28:58,924 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 21:28:58,924 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 21:28:58,924 INFO L158 Benchmark]: Toolchain (without parser) took 187534.17ms. Allocated memory was 148.9MB in the beginning and 578.8MB in the end (delta: 429.9MB). Free memory was 86.4MB in the beginning and 168.9MB in the end (delta: -82.5MB). Peak memory consumption was 350.5MB. Max. memory is 16.1GB. [2022-12-13 21:28:58,924 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 148.9MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:28:58,924 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1726.81ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 86.3MB in the beginning and 81.4MB in the end (delta: 4.9MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. [2022-12-13 21:28:58,924 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.06ms. Allocated memory is still 180.4MB. Free memory was 81.4MB in the beginning and 70.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 21:28:58,924 INFO L158 Benchmark]: Boogie Preprocessor took 65.00ms. Allocated memory is still 180.4MB. Free memory was 70.9MB in the beginning and 123.0MB in the end (delta: -52.1MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2022-12-13 21:28:58,925 INFO L158 Benchmark]: RCFGBuilder took 962.74ms. Allocated memory is still 180.4MB. Free memory was 121.9MB in the beginning and 108.0MB in the end (delta: 13.9MB). Peak memory consumption was 67.4MB. Max. memory is 16.1GB. [2022-12-13 21:28:58,925 INFO L158 Benchmark]: TraceAbstraction took 184322.68ms. Allocated memory was 180.4MB in the beginning and 578.8MB in the end (delta: 398.5MB). Free memory was 108.0MB in the beginning and 300.0MB in the end (delta: -192.0MB). Peak memory consumption was 338.1MB. Max. memory is 16.1GB. [2022-12-13 21:28:58,925 INFO L158 Benchmark]: Witness Printer took 353.58ms. Allocated memory is still 578.8MB. Free memory was 300.0MB in the beginning and 168.9MB in the end (delta: 131.1MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. [2022-12-13 21:28:58,925 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 148.9MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1726.81ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 86.3MB in the beginning and 81.4MB in the end (delta: 4.9MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.06ms. Allocated memory is still 180.4MB. Free memory was 81.4MB in the beginning and 70.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.00ms. Allocated memory is still 180.4MB. Free memory was 70.9MB in the beginning and 123.0MB in the end (delta: -52.1MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. * RCFGBuilder took 962.74ms. Allocated memory is still 180.4MB. Free memory was 121.9MB in the beginning and 108.0MB in the end (delta: 13.9MB). Peak memory consumption was 67.4MB. Max. memory is 16.1GB. * TraceAbstraction took 184322.68ms. Allocated memory was 180.4MB in the beginning and 578.8MB in the end (delta: 398.5MB). Free memory was 108.0MB in the beginning and 300.0MB in the end (delta: -192.0MB). Peak memory consumption was 338.1MB. Max. memory is 16.1GB. * Witness Printer took 353.58ms. Allocated memory is still 578.8MB. Free memory was 300.0MB in the beginning and 168.9MB in the end (delta: 131.1MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 184.3s, OverallIterations: 30, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 104.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 230 mSolverCounterUnknown, 5300 SdHoareTripleChecker+Valid, 77.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5125 mSDsluCounter, 7473 SdHoareTripleChecker+Invalid, 74.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6232 mSDsCounter, 1380 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31039 IncrementalHoareTripleChecker+Invalid, 32649 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1380 mSolverCounterUnsat, 1241 mSDtfsCounter, 31039 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2629 GetRequests, 1591 SyntacticMatches, 62 SemanticMatches, 976 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11004 ImplicationChecksByTransitivity, 42.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=20, InterpolantAutomatonStates: 543, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 30 MinimizatonAttempts, 641 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 206 PreInvPairs, 225 NumberOfFragments, 5326 HoareAnnotationTreeSize, 206 FomulaSimplifications, 180 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 22 FomulaSimplificationsInter, 72867 FormulaSimplificationTreeSizeReductionInter, 8.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 7.3s SatisfiabilityAnalysisTime, 58.0s InterpolantComputationTime, 2734 NumberOfCodeBlocks, 2734 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 3009 ConstructedInterpolants, 362 QuantifiedInterpolants, 28037 SizeOfPredicates, 198 NumberOfNonLiveVariables, 35142 ConjunctsInSsa, 638 ConjunctsInUnsatCore, 49 InterpolantComputations, 20 PerfectInterpolantSequences, 811/1120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 8978]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-12-13 21:28:58,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72b7a40a-3920-4c11-80de-6d89f3765b3e/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE