./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc --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 69a4e17497471d2fff231bad199d28dc26e616d1fdaf7fc57a8b45b8dfdd40ce --- 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-5e519f3 [2022-11-02 20:21:07,295 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:21:07,299 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:21:07,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:21:07,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:21:07,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:21:07,372 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:21:07,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:21:07,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:21:07,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:21:07,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:21:07,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:21:07,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:21:07,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:21:07,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:21:07,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:21:07,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:21:07,402 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:21:07,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:21:07,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:21:07,414 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:21:07,416 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:21:07,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:21:07,422 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:21:07,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:21:07,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:21:07,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:21:07,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:21:07,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:21:07,439 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:21:07,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:21:07,441 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:21:07,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:21:07,445 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:21:07,446 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:21:07,447 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:21:07,448 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:21:07,448 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:21:07,448 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:21:07,450 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:21:07,450 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:21:07,452 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 20:21:07,501 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:21:07,501 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:21:07,502 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:21:07,502 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:21:07,503 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:21:07,504 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:21:07,505 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:21:07,505 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:21:07,505 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:21:07,506 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:21:07,507 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:21:07,507 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:21:07,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:21:07,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:21:07,508 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:21:07,508 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:21:07,509 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:21:07,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:21:07,509 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:21:07,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:21:07,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:21:07,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:21:07,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:21:07,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:21:07,511 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:21:07,511 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:21:07,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:21:07,512 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:21:07,512 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:21:07,512 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:21:07,512 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/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_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc 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 -> 69a4e17497471d2fff231bad199d28dc26e616d1fdaf7fc57a8b45b8dfdd40ce [2022-11-02 20:21:07,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:21:07,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:21:07,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:21:07,893 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:21:07,894 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:21:07,896 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i [2022-11-02 20:21:08,016 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/data/6971dd9c1/e9e9219cfaa14eba9c296940b9c2eb3a/FLAG4eb1ea13e [2022-11-02 20:21:09,141 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:21:09,142 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i [2022-11-02 20:21:09,216 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/data/6971dd9c1/e9e9219cfaa14eba9c296940b9c2eb3a/FLAG4eb1ea13e [2022-11-02 20:21:09,237 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/data/6971dd9c1/e9e9219cfaa14eba9c296940b9c2eb3a [2022-11-02 20:21:09,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:21:09,243 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:21:09,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:21:09,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:21:09,252 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:21:09,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:21:09" (1/1) ... [2022-11-02 20:21:09,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d5335d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:09, skipping insertion in model container [2022-11-02 20:21:09,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:21:09" (1/1) ... [2022-11-02 20:21:09,266 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:21:09,481 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:21:09,859 WARN L230 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_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4496,4509] [2022-11-02 20:21:09,868 WARN L230 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_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4556,4569] [2022-11-02 20:21:11,113 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:21:11,119 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:21:11,123 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:21:11,124 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:21:11,127 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:21:11,165 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:21:11,166 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:21:11,168 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:21:11,169 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:21:11,735 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-02 20:21:11,737 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-02 20:21:11,738 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-02 20:21:11,740 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-02 20:21:11,742 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-02 20:21:11,743 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-02 20:21:11,744 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-02 20:21:11,745 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-02 20:21:11,746 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-02 20:21:11,747 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-02 20:21:11,983 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-02 20:21:12,098 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:21:12,099 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:21:12,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:21:12,337 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:21:12,369 WARN L230 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_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4496,4509] [2022-11-02 20:21:12,375 WARN L230 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_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4556,4569] [2022-11-02 20:21:12,442 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:21:12,451 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:21:12,452 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:21:12,454 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:21:12,455 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:21:12,470 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:21:12,471 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:21:12,475 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:21:12,475 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:21:12,535 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-02 20:21:12,536 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-02 20:21:12,538 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-02 20:21:12,539 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-02 20:21:12,540 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-02 20:21:12,540 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-02 20:21:12,541 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-02 20:21:12,541 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-02 20:21:12,542 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-02 20:21:12,542 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-02 20:21:12,578 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-02 20:21:12,672 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:21:12,673 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:21:12,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:21:13,185 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:21:13,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:13 WrapperNode [2022-11-02 20:21:13,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:21:13,188 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:21:13,188 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:21:13,188 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:21:13,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:13" (1/1) ... [2022-11-02 20:21:13,343 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:13" (1/1) ... [2022-11-02 20:21:13,456 INFO L138 Inliner]: procedures = 693, calls = 2792, calls flagged for inlining = 61, calls inlined = 8, statements flattened = 879 [2022-11-02 20:21:13,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:21:13,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:21:13,458 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:21:13,458 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:21:13,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:13" (1/1) ... [2022-11-02 20:21:13,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:13" (1/1) ... [2022-11-02 20:21:13,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:13" (1/1) ... [2022-11-02 20:21:13,481 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:13" (1/1) ... [2022-11-02 20:21:13,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:13" (1/1) ... [2022-11-02 20:21:13,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:13" (1/1) ... [2022-11-02 20:21:13,532 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:13" (1/1) ... [2022-11-02 20:21:13,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:13" (1/1) ... [2022-11-02 20:21:13,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:21:13,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:21:13,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:21:13,550 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:21:13,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:13" (1/1) ... [2022-11-02 20:21:13,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:21:13,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:13,588 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:21:13,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:21:13,645 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-11-02 20:21:13,645 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-11-02 20:21:13,645 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-11-02 20:21:13,645 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-11-02 20:21:13,646 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2022-11-02 20:21:13,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2022-11-02 20:21:13,646 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-02 20:21:13,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:21:13,647 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-11-02 20:21:13,647 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-11-02 20:21:13,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:21:13,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-02 20:21:13,649 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-02 20:21:13,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:21:13,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:21:13,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:21:13,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:21:13,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:21:13,650 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-02 20:21:13,650 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-02 20:21:13,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-02 20:21:13,651 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-02 20:21:13,651 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-02 20:21:13,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:21:13,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:21:13,653 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq [2022-11-02 20:21:13,654 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq [2022-11-02 20:21:13,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:21:13,654 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-11-02 20:21:13,655 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-11-02 20:21:13,655 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-02 20:21:13,655 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-02 20:21:13,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:21:13,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:21:14,114 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:21:14,117 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:21:16,195 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:21:16,213 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:21:16,213 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:21:16,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:21:16 BoogieIcfgContainer [2022-11-02 20:21:16,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:21:16,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:21:16,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:21:16,228 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:21:16,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:21:09" (1/3) ... [2022-11-02 20:21:16,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf627d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:21:16, skipping insertion in model container [2022-11-02 20:21:16,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:13" (2/3) ... [2022-11-02 20:21:16,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf627d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:21:16, skipping insertion in model container [2022-11-02 20:21:16,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:21:16" (3/3) ... [2022-11-02 20:21:16,234 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_string_eq_byte_buf_harness.i [2022-11-02 20:21:16,263 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:21:16,263 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:21:16,385 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:21:16,393 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;@48efbf98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:21:16,394 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:21:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 89 states have internal predecessors, (112), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-02 20:21:16,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-02 20:21:16,421 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:16,422 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:16,424 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:16,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:16,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1812998439, now seen corresponding path program 1 times [2022-11-02 20:21:16,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:16,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185660766] [2022-11-02 20:21:16,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:16,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:17,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:21:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:17,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:21:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:17,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:21:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:17,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:21:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:17,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:21:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:17,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:21:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:17,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:21:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:17,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:21:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:17,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 20:21:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:17,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:21:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-11-02 20:21:17,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:17,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185660766] [2022-11-02 20:21:17,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185660766] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:17,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:17,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:21:17,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006231586] [2022-11-02 20:21:17,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:17,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:21:17,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:17,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:21:17,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:21:17,597 INFO L87 Difference]: Start difference. First operand has 131 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 89 states have internal predecessors, (112), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:21:18,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:18,021 INFO L93 Difference]: Finished difference Result 253 states and 352 transitions. [2022-11-02 20:21:18,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:21:18,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 72 [2022-11-02 20:21:18,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:18,043 INFO L225 Difference]: With dead ends: 253 [2022-11-02 20:21:18,047 INFO L226 Difference]: Without dead ends: 126 [2022-11-02 20:21:18,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-11-02 20:21:18,070 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 55 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:18,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 219 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:21:18,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-02 20:21:18,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-11-02 20:21:18,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 84 states have (on average 1.2619047619047619) internal successors, (106), 85 states have internal predecessors, (106), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-02 20:21:18,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 167 transitions. [2022-11-02 20:21:18,168 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 167 transitions. Word has length 72 [2022-11-02 20:21:18,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:18,170 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 167 transitions. [2022-11-02 20:21:18,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:21:18,170 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 167 transitions. [2022-11-02 20:21:18,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-02 20:21:18,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:18,174 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:18,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:21:18,175 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:18,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:18,175 INFO L85 PathProgramCache]: Analyzing trace with hash -795992417, now seen corresponding path program 1 times [2022-11-02 20:21:18,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:18,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238299853] [2022-11-02 20:21:18,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:18,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:19,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:21:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:19,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:21:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:19,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:21:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:19,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:21:19,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:19,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:21:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:19,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:21:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:19,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:21:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:19,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:21:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:19,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 20:21:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:19,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:21:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:19,475 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-11-02 20:21:19,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:19,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238299853] [2022-11-02 20:21:19,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238299853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:19,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:19,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:21:19,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728074380] [2022-11-02 20:21:19,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:19,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:21:19,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:19,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:21:19,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:21:19,480 INFO L87 Difference]: Start difference. First operand 126 states and 167 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-02 20:21:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:20,110 INFO L93 Difference]: Finished difference Result 213 states and 284 transitions. [2022-11-02 20:21:20,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:21:20,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 72 [2022-11-02 20:21:20,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:20,114 INFO L225 Difference]: With dead ends: 213 [2022-11-02 20:21:20,115 INFO L226 Difference]: Without dead ends: 129 [2022-11-02 20:21:20,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:21:20,117 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 108 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:20,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 403 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:21:20,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-02 20:21:20,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-11-02 20:21:20,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 86 states have (on average 1.255813953488372) internal successors, (108), 88 states have internal predecessors, (108), 31 states have call successors, (31), 10 states have call predecessors, (31), 11 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2022-11-02 20:21:20,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 170 transitions. [2022-11-02 20:21:20,134 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 170 transitions. Word has length 72 [2022-11-02 20:21:20,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:20,135 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 170 transitions. [2022-11-02 20:21:20,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-02 20:21:20,135 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 170 transitions. [2022-11-02 20:21:20,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-02 20:21:20,138 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:20,139 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:20,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:21:20,139 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:20,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:20,140 INFO L85 PathProgramCache]: Analyzing trace with hash -565003148, now seen corresponding path program 1 times [2022-11-02 20:21:20,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:20,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332705459] [2022-11-02 20:21:20,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:20,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:21,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:21:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:21,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:21:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:21,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:21:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:21,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:21:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:21,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:21:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:21,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:21:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:21,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:21:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:21,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:21:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:21,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:21:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:21,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:21:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:21,626 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-11-02 20:21:21,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:21,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332705459] [2022-11-02 20:21:21,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332705459] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:21,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:21,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:21:21,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828245177] [2022-11-02 20:21:21,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:21,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:21:21,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:21,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:21:21,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:21:21,630 INFO L87 Difference]: Start difference. First operand 129 states and 170 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-02 20:21:22,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:22,611 INFO L93 Difference]: Finished difference Result 225 states and 299 transitions. [2022-11-02 20:21:22,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:21:22,612 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 78 [2022-11-02 20:21:22,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:22,614 INFO L225 Difference]: With dead ends: 225 [2022-11-02 20:21:22,614 INFO L226 Difference]: Without dead ends: 167 [2022-11-02 20:21:22,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:21:22,617 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 226 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:22,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 555 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:21:22,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-02 20:21:22,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 146. [2022-11-02 20:21:22,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 98 states have (on average 1.2551020408163265) internal successors, (123), 100 states have internal predecessors, (123), 35 states have call successors, (35), 11 states have call predecessors, (35), 12 states have return successors, (36), 34 states have call predecessors, (36), 34 states have call successors, (36) [2022-11-02 20:21:22,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 194 transitions. [2022-11-02 20:21:22,639 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 194 transitions. Word has length 78 [2022-11-02 20:21:22,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:22,640 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 194 transitions. [2022-11-02 20:21:22,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-02 20:21:22,641 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 194 transitions. [2022-11-02 20:21:22,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-02 20:21:22,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:22,644 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:22,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:21:22,644 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:22,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:22,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1924525814, now seen corresponding path program 1 times [2022-11-02 20:21:22,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:22,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865777554] [2022-11-02 20:21:22,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:22,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:23,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:21:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:23,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:21:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:23,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:21:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:23,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:21:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:23,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:21:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:23,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:21:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:23,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:21:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:23,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:21:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:23,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:21:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:23,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:21:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-11-02 20:21:23,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:23,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865777554] [2022-11-02 20:21:23,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865777554] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:23,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:23,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:21:23,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946109763] [2022-11-02 20:21:23,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:23,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:21:23,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:23,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:21:23,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:21:23,456 INFO L87 Difference]: Start difference. First operand 146 states and 194 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:21:24,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:24,016 INFO L93 Difference]: Finished difference Result 250 states and 338 transitions. [2022-11-02 20:21:24,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:21:24,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 78 [2022-11-02 20:21:24,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:24,019 INFO L225 Difference]: With dead ends: 250 [2022-11-02 20:21:24,019 INFO L226 Difference]: Without dead ends: 194 [2022-11-02 20:21:24,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:21:24,021 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 67 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:24,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 380 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:21:24,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-02 20:21:24,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2022-11-02 20:21:24,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 128 states have (on average 1.2578125) internal successors, (161), 130 states have internal predecessors, (161), 51 states have call successors, (51), 11 states have call predecessors, (51), 12 states have return successors, (54), 50 states have call predecessors, (54), 50 states have call successors, (54) [2022-11-02 20:21:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 266 transitions. [2022-11-02 20:21:24,057 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 266 transitions. Word has length 78 [2022-11-02 20:21:24,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:24,060 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 266 transitions. [2022-11-02 20:21:24,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:21:24,061 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 266 transitions. [2022-11-02 20:21:24,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-02 20:21:24,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:24,067 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-11-02 20:21:24,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:21:24,068 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:24,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:24,069 INFO L85 PathProgramCache]: Analyzing trace with hash 2071762423, now seen corresponding path program 1 times [2022-11-02 20:21:24,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:24,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090321426] [2022-11-02 20:21:24,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:24,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:25,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:21:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:25,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:21:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:25,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:21:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:25,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:21:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:25,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:21:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:25,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:21:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:25,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:21:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:25,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:21:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:25,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:21:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:25,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:21:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:25,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 20:21:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:25,554 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-02 20:21:25,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:25,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090321426] [2022-11-02 20:21:25,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090321426] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:25,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:25,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:21:25,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299791813] [2022-11-02 20:21:25,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:25,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:21:25,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:25,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:21:25,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:21:25,558 INFO L87 Difference]: Start difference. First operand 192 states and 266 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-02 20:21:26,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:26,402 INFO L93 Difference]: Finished difference Result 203 states and 282 transitions. [2022-11-02 20:21:26,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:21:26,403 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 90 [2022-11-02 20:21:26,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:26,405 INFO L225 Difference]: With dead ends: 203 [2022-11-02 20:21:26,406 INFO L226 Difference]: Without dead ends: 196 [2022-11-02 20:21:26,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:21:26,407 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 80 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:26,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 715 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:21:26,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-11-02 20:21:26,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-11-02 20:21:26,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 131 states have (on average 1.251908396946565) internal successors, (164), 134 states have internal predecessors, (164), 51 states have call successors, (51), 11 states have call predecessors, (51), 13 states have return successors, (60), 50 states have call predecessors, (60), 50 states have call successors, (60) [2022-11-02 20:21:26,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 275 transitions. [2022-11-02 20:21:26,434 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 275 transitions. Word has length 90 [2022-11-02 20:21:26,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:26,435 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 275 transitions. [2022-11-02 20:21:26,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-02 20:21:26,435 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 275 transitions. [2022-11-02 20:21:26,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-02 20:21:26,437 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:26,438 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:26,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:21:26,438 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:26,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:26,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1055189439, now seen corresponding path program 1 times [2022-11-02 20:21:26,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:26,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933177148] [2022-11-02 20:21:26,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:26,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:27,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:21:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:27,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:21:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:27,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:21:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:27,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:21:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:27,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:21:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:27,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:21:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:27,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:21:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:27,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:21:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:27,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:21:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:27,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:21:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:27,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 20:21:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:27,740 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-02 20:21:27,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:27,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933177148] [2022-11-02 20:21:27,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933177148] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:27,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:27,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:21:27,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490113358] [2022-11-02 20:21:27,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:27,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:21:27,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:27,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:21:27,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:21:27,744 INFO L87 Difference]: Start difference. First operand 196 states and 275 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-02 20:21:28,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:28,512 INFO L93 Difference]: Finished difference Result 362 states and 524 transitions. [2022-11-02 20:21:28,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:21:28,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2022-11-02 20:21:28,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:28,516 INFO L225 Difference]: With dead ends: 362 [2022-11-02 20:21:28,516 INFO L226 Difference]: Without dead ends: 221 [2022-11-02 20:21:28,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 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-11-02 20:21:28,519 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 120 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:28,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 447 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:21:28,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-11-02 20:21:28,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 201. [2022-11-02 20:21:28,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 136 states have (on average 1.2573529411764706) internal successors, (171), 139 states have internal predecessors, (171), 51 states have call successors, (51), 11 states have call predecessors, (51), 13 states have return successors, (60), 50 states have call predecessors, (60), 50 states have call successors, (60) [2022-11-02 20:21:28,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 282 transitions. [2022-11-02 20:21:28,543 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 282 transitions. Word has length 94 [2022-11-02 20:21:28,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:28,544 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 282 transitions. [2022-11-02 20:21:28,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-02 20:21:28,544 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 282 transitions. [2022-11-02 20:21:28,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-02 20:21:28,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:28,547 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:28,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:21:28,547 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:28,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:28,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1313354877, now seen corresponding path program 1 times [2022-11-02 20:21:28,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:28,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399459492] [2022-11-02 20:21:28,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:28,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:31,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:21:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:31,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:21:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:31,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:21:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:31,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:21:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:31,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:21:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:31,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:21:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:31,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:21:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:31,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:21:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:31,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:21:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:31,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:21:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:31,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 20:21:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:31,671 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-02 20:21:31,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:31,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399459492] [2022-11-02 20:21:31,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399459492] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:21:31,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044101196] [2022-11-02 20:21:31,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:31,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:21:31,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:31,679 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:21:31,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:21:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:32,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 2607 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-02 20:21:32,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:21:32,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:21:33,169 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-02 20:21:33,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:21:33,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044101196] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:33,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:21:33,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 20 [2022-11-02 20:21:33,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10026414] [2022-11-02 20:21:33,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:33,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:21:33,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:33,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:21:33,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:21:33,173 INFO L87 Difference]: Start difference. First operand 201 states and 282 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 9 states have internal predecessors, (60), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-02 20:21:33,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:33,283 INFO L93 Difference]: Finished difference Result 373 states and 521 transitions. [2022-11-02 20:21:33,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:21:33,285 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 9 states have internal predecessors, (60), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 94 [2022-11-02 20:21:33,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:33,288 INFO L225 Difference]: With dead ends: 373 [2022-11-02 20:21:33,289 INFO L226 Difference]: Without dead ends: 220 [2022-11-02 20:21:33,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:21:33,291 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 20 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:33,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 936 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 57 Unchecked, 0.0s Time] [2022-11-02 20:21:33,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-02 20:21:33,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2022-11-02 20:21:33,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 154 states have (on average 1.2597402597402598) internal successors, (194), 157 states have internal predecessors, (194), 51 states have call successors, (51), 12 states have call predecessors, (51), 14 states have return successors, (60), 50 states have call predecessors, (60), 50 states have call successors, (60) [2022-11-02 20:21:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 305 transitions. [2022-11-02 20:21:33,330 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 305 transitions. Word has length 94 [2022-11-02 20:21:33,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:33,331 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 305 transitions. [2022-11-02 20:21:33,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 9 states have internal predecessors, (60), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-02 20:21:33,331 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 305 transitions. [2022-11-02 20:21:33,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-02 20:21:33,334 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:33,335 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:33,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:21:33,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:21:33,558 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:33,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:33,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1354029627, now seen corresponding path program 1 times [2022-11-02 20:21:33,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:33,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219971834] [2022-11-02 20:21:33,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:33,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:33,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:21:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:33,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:21:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:33,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:21:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:33,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:21:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:33,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:21:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:33,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:21:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:34,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:21:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:34,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:21:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:34,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-02 20:21:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:34,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:21:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:34,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 20:21:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:34,087 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-11-02 20:21:34,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:34,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219971834] [2022-11-02 20:21:34,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219971834] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:21:34,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505359443] [2022-11-02 20:21:34,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:34,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:21:34,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:34,090 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:21:34,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:21:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:34,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 2602 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:21:34,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:21:34,849 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-02 20:21:34,850 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:21:34,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505359443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:34,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:21:34,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-11-02 20:21:34,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705417085] [2022-11-02 20:21:34,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:34,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:21:34,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:34,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:21:34,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:21:34,854 INFO L87 Difference]: Start difference. First operand 220 states and 305 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 20:21:34,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:34,918 INFO L93 Difference]: Finished difference Result 379 states and 533 transitions. [2022-11-02 20:21:34,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:21:34,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2022-11-02 20:21:34,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:34,921 INFO L225 Difference]: With dead ends: 379 [2022-11-02 20:21:34,922 INFO L226 Difference]: Without dead ends: 229 [2022-11-02 20:21:34,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:21:34,924 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 20 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 493 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-11-02 20:21:34,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 493 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:21:34,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-11-02 20:21:34,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 212. [2022-11-02 20:21:34,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 147 states have (on average 1.2585034013605443) internal successors, (185), 149 states have internal predecessors, (185), 51 states have call successors, (51), 12 states have call predecessors, (51), 13 states have return successors, (58), 50 states have call predecessors, (58), 50 states have call successors, (58) [2022-11-02 20:21:34,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 294 transitions. [2022-11-02 20:21:34,952 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 294 transitions. Word has length 94 [2022-11-02 20:21:34,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:34,952 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 294 transitions. [2022-11-02 20:21:34,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 20:21:34,953 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 294 transitions. [2022-11-02 20:21:34,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-02 20:21:34,957 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:34,957 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 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] [2022-11-02 20:21:35,011 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:21:35,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-02 20:21:35,183 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:35,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:35,184 INFO L85 PathProgramCache]: Analyzing trace with hash -805510601, now seen corresponding path program 1 times [2022-11-02 20:21:35,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:35,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615759720] [2022-11-02 20:21:35,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:35,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:36,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:21:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:36,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:21:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:36,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:21:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:36,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:21:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:36,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:21:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:36,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:21:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:36,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:21:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:36,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 20:21:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:36,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:21:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:36,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 20:21:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:36,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:21:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:36,676 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-02 20:21:36,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:36,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615759720] [2022-11-02 20:21:36,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615759720] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:21:36,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469220030] [2022-11-02 20:21:36,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:36,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:21:36,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:36,680 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:21:36,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:21:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:37,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 2614 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-02 20:21:37,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:21:37,489 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-02 20:21:37,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:21:37,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469220030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:37,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:21:37,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-11-02 20:21:37,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49795727] [2022-11-02 20:21:37,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:37,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:21:37,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:37,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:21:37,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:21:37,493 INFO L87 Difference]: Start difference. First operand 212 states and 294 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-02 20:21:37,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:37,741 INFO L93 Difference]: Finished difference Result 367 states and 515 transitions. [2022-11-02 20:21:37,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:21:37,742 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 98 [2022-11-02 20:21:37,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:37,745 INFO L225 Difference]: With dead ends: 367 [2022-11-02 20:21:37,745 INFO L226 Difference]: Without dead ends: 217 [2022-11-02 20:21:37,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:21:37,747 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 12 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:37,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1183 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:21:37,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-11-02 20:21:37,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-11-02 20:21:37,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 151 states have (on average 1.2516556291390728) internal successors, (189), 154 states have internal predecessors, (189), 51 states have call successors, (51), 12 states have call predecessors, (51), 14 states have return successors, (63), 50 states have call predecessors, (63), 50 states have call successors, (63) [2022-11-02 20:21:37,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 303 transitions. [2022-11-02 20:21:37,769 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 303 transitions. Word has length 98 [2022-11-02 20:21:37,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:37,770 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 303 transitions. [2022-11-02 20:21:37,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-02 20:21:37,770 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 303 transitions. [2022-11-02 20:21:37,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-02 20:21:37,773 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:37,773 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:37,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:21:37,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-02 20:21:37,991 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:37,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:37,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1170955310, now seen corresponding path program 1 times [2022-11-02 20:21:37,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:37,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461929862] [2022-11-02 20:21:37,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:37,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:38,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:21:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:38,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:21:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:38,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:21:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:38,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:21:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:38,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:21:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:38,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:21:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:38,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:21:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:38,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:21:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:38,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-02 20:21:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:38,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:21:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:38,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:21:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:38,529 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-02 20:21:38,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:38,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461929862] [2022-11-02 20:21:38,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461929862] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:21:38,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143862844] [2022-11-02 20:21:38,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:38,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:21:38,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:38,532 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:21:38,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:21:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:39,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 2619 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:21:39,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:21:39,351 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 20:21:39,352 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:21:39,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143862844] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:39,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:21:39,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-11-02 20:21:39,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968590805] [2022-11-02 20:21:39,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:39,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:21:39,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:39,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:21:39,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:21:39,355 INFO L87 Difference]: Start difference. First operand 217 states and 303 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 20:21:39,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:39,409 INFO L93 Difference]: Finished difference Result 377 states and 535 transitions. [2022-11-02 20:21:39,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:21:39,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2022-11-02 20:21:39,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:39,413 INFO L225 Difference]: With dead ends: 377 [2022-11-02 20:21:39,413 INFO L226 Difference]: Without dead ends: 220 [2022-11-02 20:21:39,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:21:39,416 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 9 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:39,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 486 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:21:39,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-02 20:21:39,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2022-11-02 20:21:39,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 151 states have (on average 1.2384105960264902) internal successors, (187), 154 states have internal predecessors, (187), 51 states have call successors, (51), 12 states have call predecessors, (51), 14 states have return successors, (63), 50 states have call predecessors, (63), 50 states have call successors, (63) [2022-11-02 20:21:39,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 301 transitions. [2022-11-02 20:21:39,444 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 301 transitions. Word has length 100 [2022-11-02 20:21:39,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:39,444 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 301 transitions. [2022-11-02 20:21:39,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 20:21:39,445 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 301 transitions. [2022-11-02 20:21:39,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-02 20:21:39,448 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:39,448 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:39,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:21:39,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:21:39,675 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:39,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:39,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1786047986, now seen corresponding path program 1 times [2022-11-02 20:21:39,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:39,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122752695] [2022-11-02 20:21:39,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:39,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:40,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:21:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:40,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:21:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:40,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:21:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:40,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:21:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:40,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:21:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:40,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:21:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:40,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:21:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:40,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:21:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:40,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-02 20:21:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:40,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:21:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:40,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:21:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:40,337 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-11-02 20:21:40,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:40,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122752695] [2022-11-02 20:21:40,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122752695] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:21:40,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828857541] [2022-11-02 20:21:40,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:40,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:21:40,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:40,340 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:21:40,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:21:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:41,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 2621 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:21:41,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:21:41,076 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-02 20:21:41,076 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:21:41,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828857541] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:41,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:21:41,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-11-02 20:21:41,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526331657] [2022-11-02 20:21:41,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:41,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:21:41,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:41,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:21:41,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:21:41,079 INFO L87 Difference]: Start difference. First operand 217 states and 301 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 20:21:41,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:41,124 INFO L93 Difference]: Finished difference Result 383 states and 546 transitions. [2022-11-02 20:21:41,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:21:41,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2022-11-02 20:21:41,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:41,127 INFO L225 Difference]: With dead ends: 383 [2022-11-02 20:21:41,128 INFO L226 Difference]: Without dead ends: 226 [2022-11-02 20:21:41,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:21:41,130 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 34 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:41,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 484 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:21:41,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-11-02 20:21:41,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 213. [2022-11-02 20:21:41,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 147 states have (on average 1.2244897959183674) internal successors, (180), 150 states have internal predecessors, (180), 51 states have call successors, (51), 12 states have call predecessors, (51), 14 states have return successors, (63), 50 states have call predecessors, (63), 50 states have call successors, (63) [2022-11-02 20:21:41,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 294 transitions. [2022-11-02 20:21:41,151 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 294 transitions. Word has length 100 [2022-11-02 20:21:41,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:41,152 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 294 transitions. [2022-11-02 20:21:41,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 20:21:41,152 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 294 transitions. [2022-11-02 20:21:41,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-02 20:21:41,154 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:41,155 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:41,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:21:41,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:21:41,383 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:41,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:41,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1106775732, now seen corresponding path program 1 times [2022-11-02 20:21:41,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:41,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899744831] [2022-11-02 20:21:41,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:41,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:43,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:21:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:43,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:21:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:43,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:21:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:43,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:21:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:43,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:21:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:43,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:21:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:44,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:21:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:44,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:21:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:44,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-02 20:21:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:44,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:21:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:44,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:21:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:45,088 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-02 20:21:45,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:45,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899744831] [2022-11-02 20:21:45,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899744831] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:21:45,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066205942] [2022-11-02 20:21:45,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:45,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:21:45,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:45,091 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:21:45,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:21:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:45,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 2616 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-02 20:21:45,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:21:47,166 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-02 20:21:47,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:21:47,797 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-02 20:21:47,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 19 [2022-11-02 20:21:47,836 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-02 20:21:47,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066205942] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:21:47,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:21:47,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 24 [2022-11-02 20:21:47,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823814444] [2022-11-02 20:21:47,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:21:47,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-02 20:21:47,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:47,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-02 20:21:47,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:21:47,841 INFO L87 Difference]: Start difference. First operand 213 states and 294 transitions. Second operand has 24 states, 24 states have (on average 5.375) internal successors, (129), 23 states have internal predecessors, (129), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-02 20:21:50,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:50,397 INFO L93 Difference]: Finished difference Result 259 states and 342 transitions. [2022-11-02 20:21:50,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:21:50,399 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.375) internal successors, (129), 23 states have internal predecessors, (129), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) Word has length 100 [2022-11-02 20:21:50,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:50,401 INFO L225 Difference]: With dead ends: 259 [2022-11-02 20:21:50,401 INFO L226 Difference]: Without dead ends: 231 [2022-11-02 20:21:50,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 203 SyntacticMatches, 9 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2022-11-02 20:21:50,403 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 350 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 334 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:50,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 808 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1011 Invalid, 0 Unknown, 334 Unchecked, 1.7s Time] [2022-11-02 20:21:50,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-11-02 20:21:50,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 223. [2022-11-02 20:21:50,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 155 states have (on average 1.2129032258064516) internal successors, (188), 158 states have internal predecessors, (188), 51 states have call successors, (51), 14 states have call predecessors, (51), 16 states have return successors, (63), 50 states have call predecessors, (63), 50 states have call successors, (63) [2022-11-02 20:21:50,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 302 transitions. [2022-11-02 20:21:50,434 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 302 transitions. Word has length 100 [2022-11-02 20:21:50,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:50,435 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 302 transitions. [2022-11-02 20:21:50,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.375) internal successors, (129), 23 states have internal predecessors, (129), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-02 20:21:50,435 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 302 transitions. [2022-11-02 20:21:50,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-02 20:21:50,438 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:50,438 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:50,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:21:50,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 20:21:50,651 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:50,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:50,652 INFO L85 PathProgramCache]: Analyzing trace with hash 61814546, now seen corresponding path program 1 times [2022-11-02 20:21:50,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:50,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840533146] [2022-11-02 20:21:50,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:50,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:21:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:21:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:21:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:21:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:21:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:21:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:21:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:21:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-02 20:21:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:21:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:53,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:21:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-02 20:21:54,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:54,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840533146] [2022-11-02 20:21:54,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840533146] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:21:54,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220066925] [2022-11-02 20:21:54,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:54,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:21:54,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:54,268 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:21:54,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:21:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:54,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 2613 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-02 20:21:54,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:21:56,832 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-02 20:21:56,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:21:58,007 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:58,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 1 [2022-11-02 20:21:58,362 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-02 20:21:58,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 36 [2022-11-02 20:21:58,557 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-02 20:21:58,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220066925] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:21:58,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:21:58,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 33 [2022-11-02 20:21:58,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278335161] [2022-11-02 20:21:58,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:21:58,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-02 20:21:58,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:58,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-02 20:21:58,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2022-11-02 20:21:58,561 INFO L87 Difference]: Start difference. First operand 223 states and 302 transitions. Second operand has 33 states, 33 states have (on average 4.090909090909091) internal successors, (135), 32 states have internal predecessors, (135), 6 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26) [2022-11-02 20:22:05,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:05,032 INFO L93 Difference]: Finished difference Result 353 states and 508 transitions. [2022-11-02 20:22:05,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-02 20:22:05,034 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.090909090909091) internal successors, (135), 32 states have internal predecessors, (135), 6 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26) Word has length 100 [2022-11-02 20:22:05,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:05,037 INFO L225 Difference]: With dead ends: 353 [2022-11-02 20:22:05,037 INFO L226 Difference]: Without dead ends: 341 [2022-11-02 20:22:05,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 193 SyntacticMatches, 10 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=618, Invalid=2804, Unknown=0, NotChecked=0, Total=3422 [2022-11-02 20:22:05,040 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 313 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 2078 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 2771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 618 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:05,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1448 Invalid, 2771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2078 Invalid, 0 Unknown, 618 Unchecked, 3.7s Time] [2022-11-02 20:22:05,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-11-02 20:22:05,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 334. [2022-11-02 20:22:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 232 states have (on average 1.2155172413793103) internal successors, (282), 235 states have internal predecessors, (282), 81 states have call successors, (81), 17 states have call predecessors, (81), 20 states have return successors, (117), 81 states have call predecessors, (117), 80 states have call successors, (117) [2022-11-02 20:22:05,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 480 transitions. [2022-11-02 20:22:05,102 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 480 transitions. Word has length 100 [2022-11-02 20:22:05,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:05,102 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 480 transitions. [2022-11-02 20:22:05,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.090909090909091) internal successors, (135), 32 states have internal predecessors, (135), 6 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26) [2022-11-02 20:22:05,103 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 480 transitions. [2022-11-02 20:22:05,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-02 20:22:05,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:22:05,106 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:22:05,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:22:05,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 20:22:05,326 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:22:05,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:05,327 INFO L85 PathProgramCache]: Analyzing trace with hash 319979984, now seen corresponding path program 1 times [2022-11-02 20:22:05,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:05,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888458846] [2022-11-02 20:22:05,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:05,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:06,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:22:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:06,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:22:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:06,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:22:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:06,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:22:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:06,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:22:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:06,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:22:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:06,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:22:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:06,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:22:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:06,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-02 20:22:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:06,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:22:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:06,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:22:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:06,327 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-02 20:22:06,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:22:06,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888458846] [2022-11-02 20:22:06,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888458846] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:22:06,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:22:06,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:22:06,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141353985] [2022-11-02 20:22:06,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:22:06,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:22:06,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:22:06,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:22:06,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:22:06,331 INFO L87 Difference]: Start difference. First operand 334 states and 480 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-02 20:22:07,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:07,047 INFO L93 Difference]: Finished difference Result 490 states and 688 transitions. [2022-11-02 20:22:07,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:22:07,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2022-11-02 20:22:07,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:07,051 INFO L225 Difference]: With dead ends: 490 [2022-11-02 20:22:07,051 INFO L226 Difference]: Without dead ends: 325 [2022-11-02 20:22:07,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:22:07,053 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 78 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:07,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 446 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:22:07,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-11-02 20:22:07,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2022-11-02 20:22:07,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 224 states have (on average 1.2142857142857142) internal successors, (272), 226 states have internal predecessors, (272), 81 states have call successors, (81), 17 states have call predecessors, (81), 19 states have return successors, (116), 81 states have call predecessors, (116), 80 states have call successors, (116) [2022-11-02 20:22:07,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 469 transitions. [2022-11-02 20:22:07,100 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 469 transitions. Word has length 100 [2022-11-02 20:22:07,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:07,101 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 469 transitions. [2022-11-02 20:22:07,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-02 20:22:07,101 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 469 transitions. [2022-11-02 20:22:07,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-02 20:22:07,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:22:07,104 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:22:07,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:22:07,105 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:22:07,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:07,106 INFO L85 PathProgramCache]: Analyzing trace with hash 102489296, now seen corresponding path program 1 times [2022-11-02 20:22:07,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:07,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869316051] [2022-11-02 20:22:07,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:07,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:10,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:22:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:10,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:22:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:10,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:22:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:10,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:22:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:10,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:22:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:10,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:22:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:11,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:22:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:11,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:22:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:11,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-02 20:22:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:11,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:22:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:11,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:22:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:11,725 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-02 20:22:11,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:22:11,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869316051] [2022-11-02 20:22:11,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869316051] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:22:11,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320117683] [2022-11-02 20:22:11,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:11,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:22:11,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:22:11,728 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:22:11,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:22:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:12,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 2618 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-02 20:22:12,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:22:14,259 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-02 20:22:14,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:22:15,501 INFO L356 Elim1Store]: treesize reduction 15, result has 69.4 percent of original size [2022-11-02 20:22:15,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 49 [2022-11-02 20:22:16,050 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-02 20:22:16,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320117683] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:22:16,051 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:22:16,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 30 [2022-11-02 20:22:16,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718493666] [2022-11-02 20:22:16,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:22:16,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-02 20:22:16,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:22:16,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-02 20:22:16,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2022-11-02 20:22:16,056 INFO L87 Difference]: Start difference. First operand 325 states and 469 transitions. Second operand has 30 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-02 20:22:20,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:20,222 INFO L93 Difference]: Finished difference Result 349 states and 492 transitions. [2022-11-02 20:22:20,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:22:20,223 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) Word has length 100 [2022-11-02 20:22:20,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:20,226 INFO L225 Difference]: With dead ends: 349 [2022-11-02 20:22:20,227 INFO L226 Difference]: Without dead ends: 337 [2022-11-02 20:22:20,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 197 SyntacticMatches, 11 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=382, Invalid=1780, Unknown=0, NotChecked=0, Total=2162 [2022-11-02 20:22:20,229 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 240 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:20,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 885 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1190 Invalid, 0 Unknown, 204 Unchecked, 2.2s Time] [2022-11-02 20:22:20,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-11-02 20:22:20,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 320. [2022-11-02 20:22:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 220 states have (on average 1.2181818181818183) internal successors, (268), 221 states have internal predecessors, (268), 81 states have call successors, (81), 17 states have call predecessors, (81), 18 states have return successors, (107), 81 states have call predecessors, (107), 80 states have call successors, (107) [2022-11-02 20:22:20,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 456 transitions. [2022-11-02 20:22:20,290 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 456 transitions. Word has length 100 [2022-11-02 20:22:20,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:20,291 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 456 transitions. [2022-11-02 20:22:20,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-02 20:22:20,291 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 456 transitions. [2022-11-02 20:22:20,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-02 20:22:20,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:22:20,295 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-11-02 20:22:20,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:22:20,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-02 20:22:20,510 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:22:20,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:20,511 INFO L85 PathProgramCache]: Analyzing trace with hash -430654057, now seen corresponding path program 1 times [2022-11-02 20:22:20,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:20,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443785337] [2022-11-02 20:22:20,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:20,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:21,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:22:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:21,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:22:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:21,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:22:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:21,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:22:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:21,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:22:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:21,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:22:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:21,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:22:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:21,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:22:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:21,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-02 20:22:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:21,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:22:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:21,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:22:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:21,810 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-02 20:22:21,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:22:21,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443785337] [2022-11-02 20:22:21,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443785337] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:22:21,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:22:21,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:22:21,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072315355] [2022-11-02 20:22:21,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:22:21,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:22:21,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:22:21,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:22:21,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:22:21,813 INFO L87 Difference]: Start difference. First operand 320 states and 456 transitions. Second operand has 11 states, 10 states have (on average 5.3) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-02 20:22:22,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:22,743 INFO L93 Difference]: Finished difference Result 331 states and 473 transitions. [2022-11-02 20:22:22,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:22:22,744 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2022-11-02 20:22:22,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:22,747 INFO L225 Difference]: With dead ends: 331 [2022-11-02 20:22:22,747 INFO L226 Difference]: Without dead ends: 289 [2022-11-02 20:22:22,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:22:22,749 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 84 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:22,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 885 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:22:22,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-11-02 20:22:22,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2022-11-02 20:22:22,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 197 states have (on average 1.2030456852791878) internal successors, (237), 199 states have internal predecessors, (237), 69 states have call successors, (69), 17 states have call predecessors, (69), 18 states have return successors, (86), 68 states have call predecessors, (86), 67 states have call successors, (86) [2022-11-02 20:22:22,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 392 transitions. [2022-11-02 20:22:22,798 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 392 transitions. Word has length 102 [2022-11-02 20:22:22,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:22,798 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 392 transitions. [2022-11-02 20:22:22,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-02 20:22:22,799 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 392 transitions. [2022-11-02 20:22:22,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-02 20:22:22,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:22:22,802 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-11-02 20:22:22,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:22:22,802 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:22:22,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:22,803 INFO L85 PathProgramCache]: Analyzing trace with hash 704139607, now seen corresponding path program 1 times [2022-11-02 20:22:22,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:22,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560664193] [2022-11-02 20:22:22,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:22,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:25,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:22:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:25,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:22:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:25,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:22:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:25,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:22:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:25,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:22:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:25,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:22:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:25,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:22:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:25,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:22:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:25,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-02 20:22:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:25,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:22:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:25,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:22:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-02 20:22:26,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:22:26,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560664193] [2022-11-02 20:22:26,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560664193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:22:26,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:22:26,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-02 20:22:26,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952894068] [2022-11-02 20:22:26,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:22:26,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 20:22:26,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:22:26,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 20:22:26,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:22:26,233 INFO L87 Difference]: Start difference. First operand 285 states and 392 transitions. Second operand has 17 states, 16 states have (on average 3.9375) internal successors, (63), 13 states have internal predecessors, (63), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-02 20:22:28,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:28,026 INFO L93 Difference]: Finished difference Result 295 states and 406 transitions. [2022-11-02 20:22:28,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:22:28,027 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 13 states have internal predecessors, (63), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) Word has length 102 [2022-11-02 20:22:28,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:28,030 INFO L225 Difference]: With dead ends: 295 [2022-11-02 20:22:28,031 INFO L226 Difference]: Without dead ends: 230 [2022-11-02 20:22:28,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2022-11-02 20:22:28,036 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 177 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:28,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 928 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-02 20:22:28,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-02 20:22:28,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 167. [2022-11-02 20:22:28,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 118 states have (on average 1.1864406779661016) internal successors, (140), 120 states have internal predecessors, (140), 33 states have call successors, (33), 14 states have call predecessors, (33), 15 states have return successors, (36), 32 states have call predecessors, (36), 32 states have call successors, (36) [2022-11-02 20:22:28,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 209 transitions. [2022-11-02 20:22:28,065 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 209 transitions. Word has length 102 [2022-11-02 20:22:28,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:28,065 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 209 transitions. [2022-11-02 20:22:28,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 13 states have internal predecessors, (63), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-02 20:22:28,066 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 209 transitions. [2022-11-02 20:22:28,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-02 20:22:28,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:22:28,068 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:22:28,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:22:28,069 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:22:28,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:28,070 INFO L85 PathProgramCache]: Analyzing trace with hash 523668838, now seen corresponding path program 1 times [2022-11-02 20:22:28,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:28,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345458331] [2022-11-02 20:22:28,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:28,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:28,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:22:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:28,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:22:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:29,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:22:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:29,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:22:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:29,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:22:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:29,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:22:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:29,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:22:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:29,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 20:22:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:29,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:22:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:29,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 20:22:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:29,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:22:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:29,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:22:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:29,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 20:22:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:29,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:22:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:29,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-02 20:22:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:29,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:22:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-11-02 20:22:29,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:22:29,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345458331] [2022-11-02 20:22:29,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345458331] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:22:29,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587113440] [2022-11-02 20:22:29,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:29,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:22:29,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:22:29,785 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:22:29,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:22:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:30,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 2725 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-02 20:22:30,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:22:30,763 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-11-02 20:22:30,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:22:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-11-02 20:22:30,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587113440] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:22:30,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:22:30,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 23 [2022-11-02 20:22:30,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736860917] [2022-11-02 20:22:30,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:22:30,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-02 20:22:30,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:22:30,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 20:22:30,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:22:30,976 INFO L87 Difference]: Start difference. First operand 167 states and 209 transitions. Second operand has 23 states, 21 states have (on average 3.857142857142857) internal successors, (81), 17 states have internal predecessors, (81), 9 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 9 states have call successors, (23) [2022-11-02 20:22:31,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:31,869 INFO L93 Difference]: Finished difference Result 185 states and 223 transitions. [2022-11-02 20:22:31,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:22:31,876 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.857142857142857) internal successors, (81), 17 states have internal predecessors, (81), 9 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 9 states have call successors, (23) Word has length 118 [2022-11-02 20:22:31,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:31,879 INFO L225 Difference]: With dead ends: 185 [2022-11-02 20:22:31,880 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:22:31,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2022-11-02 20:22:31,883 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 58 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:31,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 260 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:22:31,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:22:31,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:22:31,885 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-11-02 20:22:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:22:31,885 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2022-11-02 20:22:31,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:31,886 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:22:31,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.857142857142857) internal successors, (81), 17 states have internal predecessors, (81), 9 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 9 states have call successors, (23) [2022-11-02 20:22:31,886 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:22:31,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:22:31,890 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:22:31,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:22:32,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 20:22:32,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-02 20:22:38,508 INFO L895 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) [2022-11-02 20:22:38,508 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6800 6804) no Hoare annotation was computed. [2022-11-02 20:22:38,509 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) [2022-11-02 20:22:38,509 INFO L899 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2022-11-02 20:22:38,509 INFO L895 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (let ((.cse1 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or (let ((.cse0 (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)))) (and (<= (+ .cse0 1) |ensure_string_is_allocated_bounded_length_~len~1#1|) (<= |ensure_string_is_allocated_bounded_length_~len~1#1| (+ .cse0 15)))) .cse1) (or .cse1 (<= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| (+ 15 (* 18446744073709551616 (div (+ (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 18446744073709551616))))) (= |old(#valid)| |#valid|))) [2022-11-02 20:22:38,510 INFO L899 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2022-11-02 20:22:38,510 INFO L895 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) [2022-11-02 20:22:38,510 INFO L899 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2022-11-02 20:22:38,510 INFO L895 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-11-02 20:22:38,510 INFO L895 garLoopResultBuilder]: At program point ensure_string_is_allocated_bounded_lengthENTRY(lines 6800 6804) the Hoare annotation is: (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|)) [2022-11-02 20:22:38,511 INFO L899 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2022-11-02 20:22:38,511 INFO L899 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2022-11-02 20:22:38,511 INFO L895 garLoopResultBuilder]: At program point L6801(line 6801) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-11-02 20:22:38,511 INFO L899 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2022-11-02 20:22:38,511 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6800 6804) no Hoare annotation was computed. [2022-11-02 20:22:38,511 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-11-02 20:22:38,511 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-11-02 20:22:38,512 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-11-02 20:22:38,512 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-11-02 20:22:38,512 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-11-02 20:22:38,512 INFO L902 garLoopResultBuilder]: At program point aws_array_eqENTRY(lines 7684 7704) the Hoare annotation is: true [2022-11-02 20:22:38,512 INFO L899 garLoopResultBuilder]: For program point L7697(lines 7697 7701) no Hoare annotation was computed. [2022-11-02 20:22:38,512 INFO L899 garLoopResultBuilder]: For program point aws_array_eqEXIT(lines 7684 7704) no Hoare annotation was computed. [2022-11-02 20:22:38,512 INFO L902 garLoopResultBuilder]: At program point L7686(line 7686) the Hoare annotation is: true [2022-11-02 20:22:38,512 INFO L899 garLoopResultBuilder]: For program point L7688(lines 7685 7704) no Hoare annotation was computed. [2022-11-02 20:22:38,512 INFO L899 garLoopResultBuilder]: For program point aws_array_eqFINAL(lines 7684 7704) no Hoare annotation was computed. [2022-11-02 20:22:38,513 INFO L902 garLoopResultBuilder]: At program point L7686-1(line 7686) the Hoare annotation is: true [2022-11-02 20:22:38,513 INFO L899 garLoopResultBuilder]: For program point L7364-6(line 7364) no Hoare annotation was computed. [2022-11-02 20:22:38,513 INFO L899 garLoopResultBuilder]: For program point L7364-4(line 7364) no Hoare annotation was computed. [2022-11-02 20:22:38,513 INFO L899 garLoopResultBuilder]: For program point L7364-3(line 7364) no Hoare annotation was computed. [2022-11-02 20:22:38,513 INFO L899 garLoopResultBuilder]: For program point L7364-8(line 7364) no Hoare annotation was computed. [2022-11-02 20:22:38,513 INFO L902 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7359 7365) the Hoare annotation is: true [2022-11-02 20:22:38,513 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7359 7365) no Hoare annotation was computed. [2022-11-02 20:22:38,513 INFO L899 garLoopResultBuilder]: For program point L7361-3(line 7361) no Hoare annotation was computed. [2022-11-02 20:22:38,514 INFO L899 garLoopResultBuilder]: For program point L7361-1(line 7361) no Hoare annotation was computed. [2022-11-02 20:22:38,514 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7359 7365) no Hoare annotation was computed. [2022-11-02 20:22:38,514 INFO L899 garLoopResultBuilder]: For program point L7361(lines 7361 7364) no Hoare annotation was computed. [2022-11-02 20:22:38,514 INFO L899 garLoopResultBuilder]: For program point L7361-7(lines 7361 7364) no Hoare annotation was computed. [2022-11-02 20:22:38,514 INFO L899 garLoopResultBuilder]: For program point L7361-6(lines 7361 7362) no Hoare annotation was computed. [2022-11-02 20:22:38,515 INFO L899 garLoopResultBuilder]: For program point L7361-4(lines 7361 7362) no Hoare annotation was computed. [2022-11-02 20:22:38,515 INFO L899 garLoopResultBuilder]: For program point L7361-11(lines 7361 7364) no Hoare annotation was computed. [2022-11-02 20:22:38,515 INFO L899 garLoopResultBuilder]: For program point L7361-9(lines 7361 7364) no Hoare annotation was computed. [2022-11-02 20:22:38,515 INFO L899 garLoopResultBuilder]: For program point L7364-2(line 7364) no Hoare annotation was computed. [2022-11-02 20:22:38,515 INFO L899 garLoopResultBuilder]: For program point L7364(line 7364) no Hoare annotation was computed. [2022-11-02 20:22:38,516 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-11-02 20:22:38,516 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-11-02 20:22:38,516 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-11-02 20:22:38,516 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-11-02 20:22:38,516 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-11-02 20:22:38,517 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-02 20:22:38,517 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-11-02 20:22:38,517 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2022-11-02 20:22:38,517 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2022-11-02 20:22:38,517 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2022-11-02 20:22:38,518 INFO L902 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2022-11-02 20:22:38,518 INFO L899 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2022-11-02 20:22:38,518 INFO L899 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2022-11-02 20:22:38,518 INFO L899 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2022-11-02 20:22:38,518 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2022-11-02 20:22:38,519 INFO L899 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2022-11-02 20:22:38,519 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2022-11-02 20:22:38,519 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-11-02 20:22:38,519 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-11-02 20:22:38,519 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-11-02 20:22:38,520 INFO L895 garLoopResultBuilder]: At program point L9408(line 9408) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse2 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse3 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 0 (+ .cse4 (* 18446744073709551616 (div (- .cse4) 18446744073709551616)))) .cse5) (and .cse0 .cse1 .cse2 (<= .cse4 (+ .cse6 (* 18446744073709551616 (div (+ (- .cse6) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse4 18446744073709551616)))) .cse3 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-11-02 20:22:38,520 INFO L899 garLoopResultBuilder]: For program point L9408-1(line 9408) no Hoare annotation was computed. [2022-11-02 20:22:38,520 INFO L895 garLoopResultBuilder]: At program point L9408-2(lines 9386 9409) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse2 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse3 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 0 (+ .cse4 (* 18446744073709551616 (div (- .cse4) 18446744073709551616)))) .cse5) (and .cse0 .cse1 .cse2 (<= .cse4 (+ .cse6 (* 18446744073709551616 (div (+ (- .cse6) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse4 18446744073709551616)))) .cse3 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-11-02 20:22:38,521 INFO L899 garLoopResultBuilder]: For program point L6609(lines 6609 6614) no Hoare annotation was computed. [2022-11-02 20:22:38,521 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-02 20:22:38,521 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-02 20:22:38,521 INFO L895 garLoopResultBuilder]: At program point L6610(line 6610) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2022-11-02 20:22:38,522 INFO L902 garLoopResultBuilder]: At program point L9558(line 9558) the Hoare annotation is: true [2022-11-02 20:22:38,522 INFO L899 garLoopResultBuilder]: For program point L6610-3(lines 6610 6612) no Hoare annotation was computed. [2022-11-02 20:22:38,522 INFO L899 garLoopResultBuilder]: For program point L6610-1(lines 6610 6612) no Hoare annotation was computed. [2022-11-02 20:22:38,522 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2022-11-02 20:22:38,522 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-11-02 20:22:38,523 INFO L895 garLoopResultBuilder]: At program point L9551(line 9551) the Hoare annotation is: false [2022-11-02 20:22:38,523 INFO L899 garLoopResultBuilder]: For program point L9551-1(line 9551) no Hoare annotation was computed. [2022-11-02 20:22:38,523 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-11-02 20:22:38,523 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2022-11-02 20:22:38,523 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-11-02 20:22:38,524 INFO L899 garLoopResultBuilder]: For program point L6612-1(line 6612) no Hoare annotation was computed. [2022-11-02 20:22:38,524 INFO L895 garLoopResultBuilder]: At program point L6612(line 6612) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2022-11-02 20:22:38,524 INFO L895 garLoopResultBuilder]: At program point L9544(line 9544) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0)) [2022-11-02 20:22:38,524 INFO L899 garLoopResultBuilder]: For program point L9544-1(line 9544) no Hoare annotation was computed. [2022-11-02 20:22:38,524 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-11-02 20:22:38,525 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2022-11-02 20:22:38,525 INFO L899 garLoopResultBuilder]: For program point L6613-1(line 6613) no Hoare annotation was computed. [2022-11-02 20:22:38,525 INFO L895 garLoopResultBuilder]: At program point L6613(line 6613) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2022-11-02 20:22:38,525 INFO L899 garLoopResultBuilder]: For program point L9388(line 9388) no Hoare annotation was computed. [2022-11-02 20:22:38,526 INFO L895 garLoopResultBuilder]: At program point L9388-2(line 9388) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse2 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse3 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 0 (+ .cse4 (* 18446744073709551616 (div (- .cse4) 18446744073709551616)))) .cse5) (and .cse0 .cse1 .cse2 (<= .cse4 (+ .cse6 (* 18446744073709551616 (div (+ (- .cse6) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse4 18446744073709551616)))) .cse3 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-11-02 20:22:38,526 INFO L895 garLoopResultBuilder]: At program point L9553(line 9553) the Hoare annotation is: false [2022-11-02 20:22:38,526 INFO L895 garLoopResultBuilder]: At program point L9553-1(line 9553) the Hoare annotation is: false [2022-11-02 20:22:38,526 INFO L899 garLoopResultBuilder]: For program point L9553-2(line 9553) no Hoare annotation was computed. [2022-11-02 20:22:38,527 INFO L899 garLoopResultBuilder]: For program point L9388-3(line 9388) no Hoare annotation was computed. [2022-11-02 20:22:38,527 INFO L895 garLoopResultBuilder]: At program point L9388-4(line 9388) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse2 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse3 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 0 (+ .cse4 (* 18446744073709551616 (div (- .cse4) 18446744073709551616)))) .cse5) (and .cse0 .cse1 .cse2 (<= .cse4 (+ .cse6 (* 18446744073709551616 (div (+ (- .cse6) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse4 18446744073709551616)))) .cse3 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-11-02 20:22:38,527 INFO L899 garLoopResultBuilder]: For program point L9388-5(line 9388) no Hoare annotation was computed. [2022-11-02 20:22:38,527 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-02 20:22:38,528 INFO L899 garLoopResultBuilder]: For program point L9389(line 9389) no Hoare annotation was computed. [2022-11-02 20:22:38,528 INFO L895 garLoopResultBuilder]: At program point L9389-2(line 9389) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse2 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse3 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 0 (+ .cse4 (* 18446744073709551616 (div (- .cse4) 18446744073709551616)))) .cse5) (and .cse0 .cse1 .cse2 (<= .cse4 (+ .cse6 (* 18446744073709551616 (div (+ (- .cse6) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse4 18446744073709551616)))) .cse3 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-11-02 20:22:38,528 INFO L895 garLoopResultBuilder]: At program point L9546(line 9546) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2022-11-02 20:22:38,528 INFO L899 garLoopResultBuilder]: For program point L9389-3(line 9389) no Hoare annotation was computed. [2022-11-02 20:22:38,529 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2022-11-02 20:22:38,529 INFO L899 garLoopResultBuilder]: For program point L9538(lines 9538 9557) no Hoare annotation was computed. [2022-11-02 20:22:38,529 INFO L895 garLoopResultBuilder]: At program point L9546-1(line 9546) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse4 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse5 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse0 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and (<= |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1351#1| 0) .cse0 .cse1 (<= 0 |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1351#1|)) (and .cse2 .cse3 .cse4 .cse0 (<= 0 (+ .cse5 (* 18446744073709551616 (div (- .cse5) 18446744073709551616)))) .cse1) (and .cse2 .cse3 .cse4 (<= .cse5 (+ .cse6 (* 18446744073709551616 (div (+ (- .cse6) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse5 18446744073709551616)))) .cse0 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) .cse1 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-11-02 20:22:38,530 INFO L895 garLoopResultBuilder]: At program point L9389-4(line 9389) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse2 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse3 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 0 (+ .cse4 (* 18446744073709551616 (div (- .cse4) 18446744073709551616)))) .cse5) (and .cse0 .cse1 .cse2 (<= .cse4 (+ .cse6 (* 18446744073709551616 (div (+ (- .cse6) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse4 18446744073709551616)))) .cse3 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-11-02 20:22:38,530 INFO L899 garLoopResultBuilder]: For program point L9546-2(line 9546) no Hoare annotation was computed. [2022-11-02 20:22:38,530 INFO L899 garLoopResultBuilder]: For program point L9389-5(line 9389) no Hoare annotation was computed. [2022-11-02 20:22:38,530 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-11-02 20:22:38,530 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-02 20:22:38,531 INFO L899 garLoopResultBuilder]: For program point L9390(lines 9390 9398) no Hoare annotation was computed. [2022-11-02 20:22:38,531 INFO L902 garLoopResultBuilder]: At program point L9539(line 9539) the Hoare annotation is: true [2022-11-02 20:22:38,531 INFO L899 garLoopResultBuilder]: For program point L9539-1(lines 9539 9540) no Hoare annotation was computed. [2022-11-02 20:22:38,531 INFO L902 garLoopResultBuilder]: At program point L9539-2(line 9539) the Hoare annotation is: true [2022-11-02 20:22:38,531 INFO L899 garLoopResultBuilder]: For program point L9539-3(line 9539) no Hoare annotation was computed. [2022-11-02 20:22:38,532 INFO L899 garLoopResultBuilder]: For program point L9539-5(lines 9539 9540) no Hoare annotation was computed. [2022-11-02 20:22:38,532 INFO L895 garLoopResultBuilder]: At program point L9556(line 9556) the Hoare annotation is: (and (<= |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1360#1| 1) (<= 1 |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1360#1|) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0)) [2022-11-02 20:22:38,532 INFO L899 garLoopResultBuilder]: For program point L9556-1(line 9556) no Hoare annotation was computed. [2022-11-02 20:22:38,532 INFO L899 garLoopResultBuilder]: For program point L9399(lines 9399 9407) no Hoare annotation was computed. [2022-11-02 20:22:38,533 INFO L895 garLoopResultBuilder]: At program point L9548(line 9548) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse6 (select .cse7 16))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse2 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (.cse4 (select .cse7 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse3 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 0 (+ .cse4 (* 18446744073709551616 (div (- .cse4) 18446744073709551616)))) .cse5) (and .cse0 .cse1 .cse2 (<= .cse4 (+ .cse6 (* 18446744073709551616 (div (+ (- .cse6) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse4 18446744073709551616)))) .cse3 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-11-02 20:22:38,533 INFO L899 garLoopResultBuilder]: For program point L9548-1(lines 9548 9549) no Hoare annotation was computed. [2022-11-02 20:22:38,533 INFO L895 garLoopResultBuilder]: At program point L6600(lines 6598 6601) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0)) [2022-11-02 20:22:38,533 INFO L899 garLoopResultBuilder]: For program point L9548-3(lines 9548 9549) no Hoare annotation was computed. [2022-11-02 20:22:38,534 INFO L899 garLoopResultBuilder]: For program point L9548-4(lines 9548 9554) no Hoare annotation was computed. [2022-11-02 20:22:38,534 INFO L895 garLoopResultBuilder]: At program point L9548-6(lines 9548 9554) the Hoare annotation is: (let ((.cse5 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse4 (select .cse5 16))) (let ((.cse0 (<= .cse4 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse4) 18446744073709551616))))) (.cse2 (select .cse5 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|)) (.cse1 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 .cse1 (<= 0 (+ .cse2 (* 18446744073709551616 (div (- .cse2) 18446744073709551616)))) .cse3) (and .cse0 (<= .cse2 (+ .cse4 (* 18446744073709551616 (div (+ (- .cse4) 18446744073709551615) 18446744073709551616)) (* 18446744073709551616 (div .cse2 18446744073709551616)))) .cse1 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) .cse3 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2022-11-02 20:22:38,534 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-11-02 20:22:38,535 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-11-02 20:22:38,535 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-11-02 20:22:38,535 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-11-02 20:22:38,535 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-11-02 20:22:38,535 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-11-02 20:22:38,540 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:22:38,543 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:22:38,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:38,593 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR [2022-11-02 20:22:38,596 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:38,597 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR [2022-11-02 20:22:38,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:22:38 BoogieIcfgContainer [2022-11-02 20:22:38,612 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:22:38,612 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:22:38,613 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:22:38,613 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:22:38,614 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:21:16" (3/4) ... [2022-11-02 20:22:38,617 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:22:38,626 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2022-11-02 20:22:38,628 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-11-02 20:22:38,628 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_eq [2022-11-02 20:22:38,628 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-11-02 20:22:38,628 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2022-11-02 20:22:38,628 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-11-02 20:22:38,629 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-02 20:22:38,629 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-02 20:22:38,629 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-11-02 20:22:38,630 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2022-11-02 20:22:38,659 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 129 nodes and edges [2022-11-02 20:22:38,661 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 59 nodes and edges [2022-11-02 20:22:38,662 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-11-02 20:22:38,665 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-11-02 20:22:38,666 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-11-02 20:22:38,668 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-02 20:22:38,669 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:22:38,671 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:22:38,724 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(max_size) == max_size || 16 == max_size) && !(str == 0)) && !(\result == 0)) && !(\old(max_size) == 16) [2022-11-02 20:22:39,320 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:22:39,320 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:22:39,321 INFO L158 Benchmark]: Toolchain (without parser) took 90077.87ms. Allocated memory was 127.9MB in the beginning and 771.8MB in the end (delta: 643.8MB). Free memory was 84.8MB in the beginning and 482.8MB in the end (delta: -397.9MB). Peak memory consumption was 245.8MB. Max. memory is 16.1GB. [2022-11-02 20:22:39,322 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 94.4MB. Free memory was 47.6MB in the beginning and 47.6MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:22:39,322 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3939.64ms. Allocated memory was 127.9MB in the beginning and 169.9MB in the end (delta: 41.9MB). Free memory was 84.5MB in the beginning and 98.8MB in the end (delta: -14.3MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. [2022-11-02 20:22:39,323 INFO L158 Benchmark]: Boogie Procedure Inliner took 269.54ms. Allocated memory is still 169.9MB. Free memory was 98.8MB in the beginning and 86.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-02 20:22:39,323 INFO L158 Benchmark]: Boogie Preprocessor took 91.39ms. Allocated memory is still 169.9MB. Free memory was 86.2MB in the beginning and 78.9MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:22:39,323 INFO L158 Benchmark]: RCFGBuilder took 2668.49ms. Allocated memory was 169.9MB in the beginning and 253.8MB in the end (delta: 83.9MB). Free memory was 78.9MB in the beginning and 162.9MB in the end (delta: -84.0MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2022-11-02 20:22:39,324 INFO L158 Benchmark]: TraceAbstraction took 82389.63ms. Allocated memory was 253.8MB in the beginning and 771.8MB in the end (delta: 518.0MB). Free memory was 161.9MB in the beginning and 613.8MB in the end (delta: -452.0MB). Peak memory consumption was 428.8MB. Max. memory is 16.1GB. [2022-11-02 20:22:39,324 INFO L158 Benchmark]: Witness Printer took 707.72ms. Allocated memory is still 771.8MB. Free memory was 613.8MB in the beginning and 482.8MB in the end (delta: 131.1MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2022-11-02 20:22:39,327 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.35ms. Allocated memory is still 94.4MB. Free memory was 47.6MB in the beginning and 47.6MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3939.64ms. Allocated memory was 127.9MB in the beginning and 169.9MB in the end (delta: 41.9MB). Free memory was 84.5MB in the beginning and 98.8MB in the end (delta: -14.3MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 269.54ms. Allocated memory is still 169.9MB. Free memory was 98.8MB in the beginning and 86.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.39ms. Allocated memory is still 169.9MB. Free memory was 86.2MB in the beginning and 78.9MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2668.49ms. Allocated memory was 169.9MB in the beginning and 253.8MB in the end (delta: 83.9MB). Free memory was 78.9MB in the beginning and 162.9MB in the end (delta: -84.0MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * TraceAbstraction took 82389.63ms. Allocated memory was 253.8MB in the beginning and 771.8MB in the end (delta: 518.0MB). Free memory was 161.9MB in the beginning and 613.8MB in the end (delta: -452.0MB). Peak memory consumption was 428.8MB. Max. memory is 16.1GB. * Witness Printer took 707.72ms. Allocated memory is still 771.8MB. Free memory was 613.8MB in the beginning and 482.8MB in the end (delta: 131.1MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR * 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 11 procedures, 131 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 82.2s, OverallIterations: 18, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 22.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2198 SdHoareTripleChecker+Valid, 14.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2051 mSDsluCounter, 11961 SdHoareTripleChecker+Invalid, 12.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1213 IncrementalHoareTripleChecker+Unchecked, 9177 mSDsCounter, 680 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8902 IncrementalHoareTripleChecker+Invalid, 10795 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 680 mSolverCounterUnsat, 2784 mSDtfsCounter, 8902 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1992 GetRequests, 1657 SyntacticMatches, 31 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2103 ImplicationChecksByTransitivity, 13.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334occurred in iteration=13, InterpolantAutomatonStates: 195, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 175 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 440 PreInvPairs, 484 NumberOfFragments, 1548 HoareAnnotationTreeSize, 440 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 45 FomulaSimplificationsInter, 2950 FormulaSimplificationTreeSizeReductionInter, 6.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 7.2s SatisfiabilityAnalysisTime, 39.7s InterpolantComputationTime, 2596 NumberOfCodeBlocks, 2596 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2983 ConstructedInterpolants, 101 QuantifiedInterpolants, 15967 SizeOfPredicates, 75 NumberOfNonLiveVariables, 23635 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 31 InterpolantComputations, 14 PerfectInterpolantSequences, 1856/2033 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: 6598]: Loop Invariant Derived loop invariant: ((str == 0 && str == 0) && !(buf == 0)) && buf == 0 - InvariantResult [Line: 9558]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9386]: Loop Invariant [2022-11-02 20:22:39,348 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:39,348 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR [2022-11-02 20:22:39,350 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:22:39,350 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR Derived loop invariant: (((((str == 0 && str == 0) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && !(buf == 0)) && 0 <= unknown-#memory_int-unknown[buf][buf] + 18446744073709551616 * (-unknown-#memory_int-unknown[buf][buf] / 18446744073709551616)) && buf == 0) || ((((((((str == 0 && str == 0) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16] + 18446744073709551616 * ((-unknown-#memory_int-unknown[buf][16] + 18446744073709551615) / 18446744073709551616) + 18446744073709551616 * (unknown-#memory_int-unknown[buf][buf] / 18446744073709551616)) && !(buf == 0)) && !(#memory_$Pointer$[buf][~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR] == 0)) && buf == 0) && buf == buf) && buf == 0) - InvariantResult [Line: 6806]: Loop Invariant Derived loop invariant: (((\old(max_size) == max_size || 16 == max_size) && !(str == 0)) && !(\result == 0)) && !(\old(max_size) == 16) RESULT: Ultimate proved your program to be correct! [2022-11-02 20:22:39,385 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4d7b4ea8-23d9-4938-bd56-69e2f0d7d8a3/bin/uautomizer-Dbtcem3rbc/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