./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP --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 caa9ea3c4b01be424b9d4542ff8acdcb39307db8022d65ba85a629a6a4ef591a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:27:16,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:27:16,120 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-06 22:27:16,127 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:27:16,128 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:27:16,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:27:16,178 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:27:16,179 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:27:16,180 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:27:16,187 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:27:16,188 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:27:16,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:27:16,189 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:27:16,191 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:27:16,192 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:27:16,192 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:27:16,193 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:27:16,193 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:27:16,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:27:16,194 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:27:16,195 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:27:16,196 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:27:16,197 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:27:16,199 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:27:16,200 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:27:16,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:27:16,201 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:27:16,201 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:27:16,202 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:27:16,202 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:27:16,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:27:16,204 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:27:16,204 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:27:16,205 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:27:16,205 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:27:16,205 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:27:16,205 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/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_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP 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 -> caa9ea3c4b01be424b9d4542ff8acdcb39307db8022d65ba85a629a6a4ef591a [2023-11-06 22:27:16,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:27:16,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:27:16,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:27:16,512 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:27:16,513 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:27:16,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i [2023-11-06 22:27:19,786 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:27:20,423 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:27:20,425 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i [2023-11-06 22:27:20,482 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/data/5dc38ae2f/82c7543e19444178ae8b4d2589439b4d/FLAGf1ef5656d [2023-11-06 22:27:20,502 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/data/5dc38ae2f/82c7543e19444178ae8b4d2589439b4d [2023-11-06 22:27:20,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:27:20,513 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:27:20,515 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:27:20,517 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:27:20,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:27:20,526 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:27:20" (1/1) ... [2023-11-06 22:27:20,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@406ab2fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:20, skipping insertion in model container [2023-11-06 22:27:20,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:27:20" (1/1) ... [2023-11-06 22:27:20,700 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:27:21,034 WARN L240 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_327abdad-31ee-4b45-9c2f-01a523693f1f/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i[4499,4512] [2023-11-06 22:27:21,047 WARN L240 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_327abdad-31ee-4b45-9c2f-01a523693f1f/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i[4559,4572] [2023-11-06 22:27:22,443 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:27:22,444 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:27:22,445 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:27:22,446 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:27:22,448 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:27:22,471 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:27:22,472 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:27:22,475 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:27:22,475 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:27:23,077 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-06 22:27:23,079 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-06 22:27:23,082 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-06 22:27:23,087 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-06 22:27:23,096 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-06 22:27:23,097 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-06 22:27:23,101 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-06 22:27:23,102 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-06 22:27:23,105 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-06 22:27:23,109 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-06 22:27:23,478 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:27:23,479 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:27:23,613 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:27:23,745 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:27:23,775 WARN L240 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_327abdad-31ee-4b45-9c2f-01a523693f1f/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i[4499,4512] [2023-11-06 22:27:23,780 WARN L240 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_327abdad-31ee-4b45-9c2f-01a523693f1f/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i[4559,4572] [2023-11-06 22:27:23,866 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:27:23,867 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:27:23,868 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:27:23,868 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:27:23,869 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:27:23,880 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:27:23,881 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:27:23,882 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:27:23,883 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:27:23,954 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-06 22:27:23,956 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-06 22:27:23,957 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-06 22:27:23,958 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-06 22:27:23,960 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-06 22:27:23,960 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-06 22:27:23,962 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-06 22:27:23,962 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-06 22:27:23,963 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-06 22:27:23,964 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-06 22:27:24,086 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8253] [2023-11-06 22:27:24,088 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:27:24,088 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:27:24,108 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8739-8750] [2023-11-06 22:27:24,214 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:27:24,397 WARN L672 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:27:24,397 WARN L672 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:27:24,397 WARN L672 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:27:24,397 WARN L672 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:27:24,397 WARN L672 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:27:24,398 WARN L672 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:27:24,398 WARN L672 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:27:24,398 WARN L672 CHandler]: The function s_global_handler is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:27:24,398 WARN L672 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:27:24,398 WARN L672 CHandler]: The function fprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:27:24,398 WARN L672 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:27:24,399 WARN L672 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:27:24,399 WARN L672 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:27:24,399 WARN L672 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:27:24,399 WARN L672 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:27:24,399 WARN L672 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:27:24,400 WARN L672 CHandler]: The function tl_thread_handler is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:27:24,400 WARN L672 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:27:24,400 WARN L672 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:27:24,400 WARN L672 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:27:24,407 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:27:24,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24 WrapperNode [2023-11-06 22:27:24,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:27:24,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:27:24,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:27:24,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:27:24,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24" (1/1) ... [2023-11-06 22:27:24,559 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24" (1/1) ... [2023-11-06 22:27:24,669 INFO L138 Inliner]: procedures = 692, calls = 2794, calls flagged for inlining = 60, calls inlined = 7, statements flattened = 864 [2023-11-06 22:27:24,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:27:24,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:27:24,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:27:24,671 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:27:24,681 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24" (1/1) ... [2023-11-06 22:27:24,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24" (1/1) ... [2023-11-06 22:27:24,697 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24" (1/1) ... [2023-11-06 22:27:24,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24" (1/1) ... [2023-11-06 22:27:24,760 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24" (1/1) ... [2023-11-06 22:27:24,778 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24" (1/1) ... [2023-11-06 22:27:24,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24" (1/1) ... [2023-11-06 22:27:24,857 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24" (1/1) ... [2023-11-06 22:27:24,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:27:24,877 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:27:24,881 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:27:24,881 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:27:24,882 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24" (1/1) ... [2023-11-06 22:27:24,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:27:24,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:27:24,917 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:27:24,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:27:24,967 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2023-11-06 22:27:24,968 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2023-11-06 22:27:24,968 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2023-11-06 22:27:24,969 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2023-11-06 22:27:24,970 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2023-11-06 22:27:24,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2023-11-06 22:27:24,971 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-06 22:27:24,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:27:24,971 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2023-11-06 22:27:24,972 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2023-11-06 22:27:24,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:27:24,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-06 22:27:24,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-06 22:27:24,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:27:24,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:27:24,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:27:24,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:27:24,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:27:24,974 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-06 22:27:24,974 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-06 22:27:24,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-11-06 22:27:24,975 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:27:24,975 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:27:24,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:27:24,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:27:24,975 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq [2023-11-06 22:27:24,976 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq [2023-11-06 22:27:24,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 22:27:24,977 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2023-11-06 22:27:24,977 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2023-11-06 22:27:24,977 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-06 22:27:24,977 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-06 22:27:24,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:27:24,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:27:25,292 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:27:25,295 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:27:27,126 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:27:27,140 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:27:27,140 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:27:27,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:27 BoogieIcfgContainer [2023-11-06 22:27:27,143 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:27:27,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:27:27,147 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:27:27,150 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:27:27,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:27:20" (1/3) ... [2023-11-06 22:27:27,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293f2b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:27:27, skipping insertion in model container [2023-11-06 22:27:27,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:27:24" (2/3) ... [2023-11-06 22:27:27,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293f2b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:27:27, skipping insertion in model container [2023-11-06 22:27:27,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:27" (3/3) ... [2023-11-06 22:27:27,162 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_string_eq_byte_cursor_harness.i [2023-11-06 22:27:27,183 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:27:27,184 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:27:27,258 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:27:27,267 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;@26561740, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:27:27,268 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:27:27,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 83 states have internal predecessors, (105), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2023-11-06 22:27:27,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-06 22:27:27,296 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:27:27,297 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:27,298 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:27:27,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:27,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1516158171, now seen corresponding path program 1 times [2023-11-06 22:27:27,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:27,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088852799] [2023-11-06 22:27:27,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:27,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:28,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:27:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:28,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:27:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:28,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-06 22:27:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:28,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:27:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:28,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:27:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:28,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:27:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:28,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:27:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:28,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:27:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:28,769 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-06 22:27:28,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:28,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088852799] [2023-11-06 22:27:28,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088852799] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:27:28,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396302191] [2023-11-06 22:27:28,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:28,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:27:28,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:27:28,779 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:27:28,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:27:29,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:29,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 2467 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:27:29,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:27:29,485 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:27:29,486 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:27:29,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396302191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:29,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:27:29,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2023-11-06 22:27:29,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480649636] [2023-11-06 22:27:29,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:29,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:27:29,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:29,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:27:29,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:27:29,554 INFO L87 Difference]: Start difference. First operand has 123 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 83 states have internal predecessors, (105), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 22:27:29,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:27:29,596 INFO L93 Difference]: Finished difference Result 237 states and 329 transitions. [2023-11-06 22:27:29,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:27:29,598 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 59 [2023-11-06 22:27:29,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:27:29,608 INFO L225 Difference]: With dead ends: 237 [2023-11-06 22:27:29,609 INFO L226 Difference]: Without dead ends: 118 [2023-11-06 22:27:29,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:27:29,617 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:27:29,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:27:29,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-06 22:27:29,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-11-06 22:27:29,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 78 states have (on average 1.2692307692307692) internal successors, (99), 79 states have internal predecessors, (99), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 22:27:29,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 156 transitions. [2023-11-06 22:27:29,673 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 156 transitions. Word has length 59 [2023-11-06 22:27:29,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:27:29,675 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 156 transitions. [2023-11-06 22:27:29,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 22:27:29,675 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 156 transitions. [2023-11-06 22:27:29,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-06 22:27:29,680 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:27:29,680 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:29,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:27:29,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-06 22:27:29,892 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:27:29,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:29,892 INFO L85 PathProgramCache]: Analyzing trace with hash -600570023, now seen corresponding path program 1 times [2023-11-06 22:27:29,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:29,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056111346] [2023-11-06 22:27:29,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:29,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:30,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:27:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:30,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:27:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:30,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-06 22:27:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:30,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:27:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:30,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:27:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:30,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:27:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:30,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:27:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:30,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:27:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:30,744 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-06 22:27:30,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:30,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056111346] [2023-11-06 22:27:30,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056111346] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:27:30,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610560585] [2023-11-06 22:27:30,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:30,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:27:30,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:27:30,747 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:27:30,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:27:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:31,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 2467 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:27:31,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:27:31,601 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 22:27:31,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:27:31,760 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-06 22:27:31,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610560585] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:27:31,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:27:31,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2023-11-06 22:27:31,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216252766] [2023-11-06 22:27:31,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:27:31,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:27:31,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:31,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:27:31,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:27:31,773 INFO L87 Difference]: Start difference. First operand 118 states and 156 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 7 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (19), 7 states have call predecessors, (19), 7 states have call successors, (19) [2023-11-06 22:27:32,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:27:32,068 INFO L93 Difference]: Finished difference Result 202 states and 269 transitions. [2023-11-06 22:27:32,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:27:32,068 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 7 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (19), 7 states have call predecessors, (19), 7 states have call successors, (19) Word has length 59 [2023-11-06 22:27:32,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:27:32,076 INFO L225 Difference]: With dead ends: 202 [2023-11-06 22:27:32,076 INFO L226 Difference]: Without dead ends: 121 [2023-11-06 22:27:32,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:27:32,083 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 208 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:27:32,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 682 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:27:32,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-06 22:27:32,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-11-06 22:27:32,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 80 states have (on average 1.2625) internal successors, (101), 82 states have internal predecessors, (101), 29 states have call successors, (29), 10 states have call predecessors, (29), 11 states have return successors, (29), 28 states have call predecessors, (29), 28 states have call successors, (29) [2023-11-06 22:27:32,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 159 transitions. [2023-11-06 22:27:32,119 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 159 transitions. Word has length 59 [2023-11-06 22:27:32,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:27:32,120 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 159 transitions. [2023-11-06 22:27:32,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 7 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (19), 7 states have call predecessors, (19), 7 states have call successors, (19) [2023-11-06 22:27:32,120 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 159 transitions. [2023-11-06 22:27:32,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-06 22:27:32,124 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:27:32,124 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:32,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:27:32,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-06 22:27:32,337 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:27:32,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:32,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1282062374, now seen corresponding path program 1 times [2023-11-06 22:27:32,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:32,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733219257] [2023-11-06 22:27:32,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:32,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:32,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:27:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:32,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:27:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:32,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-06 22:27:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:33,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:27:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:33,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:27:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:33,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:27:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:33,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:27:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:33,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:27:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:33,123 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 22:27:33,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:33,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733219257] [2023-11-06 22:27:33,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733219257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:33,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:33,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:27:33,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841187348] [2023-11-06 22:27:33,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:33,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:27:33,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:33,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:27:33,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:27:33,128 INFO L87 Difference]: Start difference. First operand 121 states and 159 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-06 22:27:33,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:27:33,183 INFO L93 Difference]: Finished difference Result 205 states and 273 transitions. [2023-11-06 22:27:33,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:27:33,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 63 [2023-11-06 22:27:33,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:27:33,186 INFO L225 Difference]: With dead ends: 205 [2023-11-06 22:27:33,186 INFO L226 Difference]: Without dead ends: 151 [2023-11-06 22:27:33,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:27:33,188 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 11 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:27:33,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 451 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:27:33,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-06 22:27:33,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2023-11-06 22:27:33,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 98 states have (on average 1.2653061224489797) internal successors, (124), 100 states have internal predecessors, (124), 39 states have call successors, (39), 10 states have call predecessors, (39), 11 states have return successors, (40), 38 states have call predecessors, (40), 38 states have call successors, (40) [2023-11-06 22:27:33,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 203 transitions. [2023-11-06 22:27:33,207 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 203 transitions. Word has length 63 [2023-11-06 22:27:33,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:27:33,208 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 203 transitions. [2023-11-06 22:27:33,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-06 22:27:33,208 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 203 transitions. [2023-11-06 22:27:33,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-06 22:27:33,211 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:27:33,211 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:33,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:27:33,212 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:27:33,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:33,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1565828381, now seen corresponding path program 1 times [2023-11-06 22:27:33,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:33,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866623020] [2023-11-06 22:27:33,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:33,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:34,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:27:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:34,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:27:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:34,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-06 22:27:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:34,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:27:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:34,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:27:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:34,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:27:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:34,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:27:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:34,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:27:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:34,284 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-06 22:27:34,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:34,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866623020] [2023-11-06 22:27:34,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866623020] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:34,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:27:34,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:27:34,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619456350] [2023-11-06 22:27:34,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:34,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:27:34,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:34,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:27:34,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:27:34,287 INFO L87 Difference]: Start difference. First operand 149 states and 203 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-06 22:27:34,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:27:34,370 INFO L93 Difference]: Finished difference Result 160 states and 217 transitions. [2023-11-06 22:27:34,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:27:34,371 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 63 [2023-11-06 22:27:34,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:27:34,373 INFO L225 Difference]: With dead ends: 160 [2023-11-06 22:27:34,373 INFO L226 Difference]: Without dead ends: 153 [2023-11-06 22:27:34,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:27:34,375 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 17 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:27:34,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1057 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:27:34,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-11-06 22:27:34,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2023-11-06 22:27:34,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 101 states have (on average 1.2574257425742574) internal successors, (127), 104 states have internal predecessors, (127), 39 states have call successors, (39), 10 states have call predecessors, (39), 12 states have return successors, (44), 38 states have call predecessors, (44), 38 states have call successors, (44) [2023-11-06 22:27:34,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 210 transitions. [2023-11-06 22:27:34,395 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 210 transitions. Word has length 63 [2023-11-06 22:27:34,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:27:34,396 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 210 transitions. [2023-11-06 22:27:34,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-06 22:27:34,396 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 210 transitions. [2023-11-06 22:27:34,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-06 22:27:34,398 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:27:34,399 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:34,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:27:34,399 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:27:34,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:34,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1937260075, now seen corresponding path program 1 times [2023-11-06 22:27:34,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:34,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867346117] [2023-11-06 22:27:34,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:34,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:36,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:27:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:36,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:27:36,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:36,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-06 22:27:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:36,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:27:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:36,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:27:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:36,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:27:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:36,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:27:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:36,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:27:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-06 22:27:37,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:37,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867346117] [2023-11-06 22:27:37,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867346117] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:27:37,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098310463] [2023-11-06 22:27:37,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:37,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:27:37,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:27:37,382 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:27:37,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:27:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:38,011 INFO L262 TraceCheckSpWp]: Trace formula consists of 2489 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-06 22:27:38,019 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:27:38,968 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-06 22:27:38,968 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:27:39,423 INFO L322 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-06 22:27:39,424 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2023-11-06 22:27:39,438 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-06 22:27:39,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098310463] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:27:39,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:27:39,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 22 [2023-11-06 22:27:39,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993555012] [2023-11-06 22:27:39,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:27:39,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-06 22:27:39,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:39,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-06 22:27:39,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2023-11-06 22:27:39,443 INFO L87 Difference]: Start difference. First operand 153 states and 210 transitions. Second operand has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 5 states have call successors, (21), 3 states have call predecessors, (21), 7 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) [2023-11-06 22:27:42,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:27:42,359 INFO L93 Difference]: Finished difference Result 288 states and 387 transitions. [2023-11-06 22:27:42,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 22:27:42,360 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 5 states have call successors, (21), 3 states have call predecessors, (21), 7 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) Word has length 67 [2023-11-06 22:27:42,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:27:42,363 INFO L225 Difference]: With dead ends: 288 [2023-11-06 22:27:42,363 INFO L226 Difference]: Without dead ends: 242 [2023-11-06 22:27:42,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 129 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2023-11-06 22:27:42,365 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 230 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 2075 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:27:42,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 2075 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-06 22:27:42,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-11-06 22:27:42,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 233. [2023-11-06 22:27:42,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 156 states have (on average 1.2564102564102564) internal successors, (196), 159 states have internal predecessors, (196), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (59), 55 states have call predecessors, (59), 54 states have call successors, (59) [2023-11-06 22:27:42,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 311 transitions. [2023-11-06 22:27:42,413 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 311 transitions. Word has length 67 [2023-11-06 22:27:42,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:27:42,413 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 311 transitions. [2023-11-06 22:27:42,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 5 states have call successors, (21), 3 states have call predecessors, (21), 7 states have return successors, (21), 5 states have call predecessors, (21), 4 states have call successors, (21) [2023-11-06 22:27:42,414 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 311 transitions. [2023-11-06 22:27:42,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-06 22:27:42,415 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:27:42,422 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:42,432 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-06 22:27:42,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:27:42,632 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:27:42,632 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:42,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2019839885, now seen corresponding path program 1 times [2023-11-06 22:27:42,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:42,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131219804] [2023-11-06 22:27:42,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:42,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:43,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:27:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:43,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:27:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:43,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-06 22:27:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:43,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:27:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:43,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:27:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:43,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:27:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:43,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:27:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:43,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-06 22:27:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:43,978 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 22:27:43,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:43,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131219804] [2023-11-06 22:27:43,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131219804] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:27:43,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249568159] [2023-11-06 22:27:43,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:43,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:27:43,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:27:43,983 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:27:44,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:27:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:44,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 2501 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:27:44,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:27:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 22:27:44,635 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:27:44,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249568159] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:44,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:27:44,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 10 [2023-11-06 22:27:44,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740058721] [2023-11-06 22:27:44,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:44,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:27:44,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:44,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:27:44,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:27:44,638 INFO L87 Difference]: Start difference. First operand 233 states and 311 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-06 22:27:44,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:27:44,847 INFO L93 Difference]: Finished difference Result 352 states and 474 transitions. [2023-11-06 22:27:44,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:27:44,848 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 71 [2023-11-06 22:27:44,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:27:44,851 INFO L225 Difference]: With dead ends: 352 [2023-11-06 22:27:44,852 INFO L226 Difference]: Without dead ends: 244 [2023-11-06 22:27:44,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:27:44,854 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 13 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:27:44,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1118 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:27:44,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2023-11-06 22:27:44,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 238. [2023-11-06 22:27:44,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 160 states have (on average 1.25) internal successors, (200), 164 states have internal predecessors, (200), 56 states have call successors, (56), 18 states have call predecessors, (56), 21 states have return successors, (62), 55 states have call predecessors, (62), 54 states have call successors, (62) [2023-11-06 22:27:44,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 318 transitions. [2023-11-06 22:27:44,905 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 318 transitions. Word has length 71 [2023-11-06 22:27:44,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:27:44,905 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 318 transitions. [2023-11-06 22:27:44,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-06 22:27:44,906 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 318 transitions. [2023-11-06 22:27:44,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-06 22:27:44,908 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:27:44,908 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-11-06 22:27:44,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:27:45,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:27:45,122 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:27:45,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:45,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1756062200, now seen corresponding path program 1 times [2023-11-06 22:27:45,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:45,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862040465] [2023-11-06 22:27:45,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:45,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:46,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:27:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:46,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:27:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:46,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-06 22:27:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:46,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:27:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:46,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:27:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:46,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:27:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:46,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-06 22:27:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:46,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-06 22:27:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:46,301 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-06 22:27:46,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:46,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862040465] [2023-11-06 22:27:46,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862040465] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:27:46,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728848277] [2023-11-06 22:27:46,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:46,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:27:46,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:27:46,304 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:27:46,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:27:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:46,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 2506 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 22:27:46,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:27:47,028 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-06 22:27:47,028 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:27:47,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728848277] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:47,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:27:47,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-06 22:27:47,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465773128] [2023-11-06 22:27:47,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:47,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:27:47,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:47,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:27:47,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:27:47,032 INFO L87 Difference]: Start difference. First operand 238 states and 318 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 22:27:47,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:27:47,756 INFO L93 Difference]: Finished difference Result 410 states and 549 transitions. [2023-11-06 22:27:47,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:27:47,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2023-11-06 22:27:47,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:27:47,760 INFO L225 Difference]: With dead ends: 410 [2023-11-06 22:27:47,760 INFO L226 Difference]: Without dead ends: 243 [2023-11-06 22:27:47,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:27:47,762 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 19 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:27:47,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 548 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:27:47,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-11-06 22:27:47,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 238. [2023-11-06 22:27:47,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 160 states have (on average 1.2375) internal successors, (198), 164 states have internal predecessors, (198), 56 states have call successors, (56), 18 states have call predecessors, (56), 21 states have return successors, (62), 55 states have call predecessors, (62), 54 states have call successors, (62) [2023-11-06 22:27:47,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 316 transitions. [2023-11-06 22:27:47,791 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 316 transitions. Word has length 73 [2023-11-06 22:27:47,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:27:47,791 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 316 transitions. [2023-11-06 22:27:47,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 22:27:47,792 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 316 transitions. [2023-11-06 22:27:47,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-06 22:27:47,794 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:27:47,794 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-11-06 22:27:47,813 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:27:48,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:27:48,014 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:27:48,015 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:48,015 INFO L85 PathProgramCache]: Analyzing trace with hash -272523910, now seen corresponding path program 1 times [2023-11-06 22:27:48,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:48,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105128792] [2023-11-06 22:27:48,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:48,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:50,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:27:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:50,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:27:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:50,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-06 22:27:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:51,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:27:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:51,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:27:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:51,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:27:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:51,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-06 22:27:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:51,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-06 22:27:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:51,257 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-06 22:27:51,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:51,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105128792] [2023-11-06 22:27:51,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105128792] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:27:51,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308867007] [2023-11-06 22:27:51,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:51,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:27:51,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:27:51,260 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:27:51,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:27:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:51,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 2511 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-06 22:27:51,841 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:27:51,915 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-06 22:27:51,922 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-06 22:27:52,576 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-06 22:27:52,577 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:27:52,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308867007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:52,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:27:52,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2023-11-06 22:27:52,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828614841] [2023-11-06 22:27:52,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:52,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:27:52,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:52,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:27:52,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:27:52,579 INFO L87 Difference]: Start difference. First operand 238 states and 316 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-06 22:27:54,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:27:54,360 INFO L93 Difference]: Finished difference Result 569 states and 759 transitions. [2023-11-06 22:27:54,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:27:54,361 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 73 [2023-11-06 22:27:54,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:27:54,365 INFO L225 Difference]: With dead ends: 569 [2023-11-06 22:27:54,365 INFO L226 Difference]: Without dead ends: 456 [2023-11-06 22:27:54,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2023-11-06 22:27:54,367 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 133 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:27:54,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 872 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-06 22:27:54,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2023-11-06 22:27:54,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 436. [2023-11-06 22:27:54,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 298 states have (on average 1.24496644295302) internal successors, (371), 306 states have internal predecessors, (371), 99 states have call successors, (99), 32 states have call predecessors, (99), 38 states have return successors, (111), 97 states have call predecessors, (111), 95 states have call successors, (111) [2023-11-06 22:27:54,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 581 transitions. [2023-11-06 22:27:54,417 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 581 transitions. Word has length 73 [2023-11-06 22:27:54,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:27:54,417 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 581 transitions. [2023-11-06 22:27:54,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-06 22:27:54,418 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 581 transitions. [2023-11-06 22:27:54,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-06 22:27:54,420 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:27:54,420 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:54,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:27:54,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:27:54,636 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:27:54,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:54,637 INFO L85 PathProgramCache]: Analyzing trace with hash 603495096, now seen corresponding path program 1 times [2023-11-06 22:27:54,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:54,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541285092] [2023-11-06 22:27:54,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:54,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:54,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:27:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:55,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:27:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:55,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-06 22:27:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:55,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:27:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:55,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:27:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:55,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:27:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:55,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-06 22:27:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:55,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-06 22:27:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:55,111 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-06 22:27:55,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:55,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541285092] [2023-11-06 22:27:55,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541285092] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:27:55,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593376904] [2023-11-06 22:27:55,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:55,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:27:55,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:27:55,116 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:27:55,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:27:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:55,667 INFO L262 TraceCheckSpWp]: Trace formula consists of 2506 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:27:55,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:27:55,680 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-06 22:27:55,680 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:27:55,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593376904] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:27:55,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:27:55,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-06 22:27:55,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144732780] [2023-11-06 22:27:55,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:27:55,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:27:55,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:27:55,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:27:55,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:27:55,686 INFO L87 Difference]: Start difference. First operand 436 states and 581 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 22:27:55,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:27:55,751 INFO L93 Difference]: Finished difference Result 714 states and 932 transitions. [2023-11-06 22:27:55,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:27:55,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2023-11-06 22:27:55,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:27:55,755 INFO L225 Difference]: With dead ends: 714 [2023-11-06 22:27:55,755 INFO L226 Difference]: Without dead ends: 351 [2023-11-06 22:27:55,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:27:55,759 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 6 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:27:55,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 457 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:27:55,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2023-11-06 22:27:55,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 336. [2023-11-06 22:27:55,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 231 states have (on average 1.2164502164502164) internal successors, (281), 236 states have internal predecessors, (281), 73 states have call successors, (73), 28 states have call predecessors, (73), 31 states have return successors, (78), 71 states have call predecessors, (78), 70 states have call successors, (78) [2023-11-06 22:27:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 432 transitions. [2023-11-06 22:27:55,797 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 432 transitions. Word has length 73 [2023-11-06 22:27:55,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:27:55,798 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 432 transitions. [2023-11-06 22:27:55,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-06 22:27:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 432 transitions. [2023-11-06 22:27:55,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-06 22:27:55,800 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:27:55,800 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2023-11-06 22:27:55,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:27:56,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:27:56,011 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:27:56,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:56,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1447989340, now seen corresponding path program 1 times [2023-11-06 22:27:56,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:27:56,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957135165] [2023-11-06 22:27:56,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:56,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:27:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:59,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:27:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:59,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:27:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:59,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:27:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:59,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:27:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:59,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:27:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:59,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:27:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:59,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:27:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:59,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-06 22:27:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:59,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:27:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:59,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:27:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:27:59,982 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-06 22:27:59,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:27:59,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957135165] [2023-11-06 22:27:59,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957135165] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:27:59,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331779220] [2023-11-06 22:27:59,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:59,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:27:59,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:27:59,985 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:28:00,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 22:28:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:00,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 2548 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-06 22:28:00,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:00,818 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:28:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 22:28:01,790 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:28:01,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331779220] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:01,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:28:01,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [17] total 25 [2023-11-06 22:28:01,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827213831] [2023-11-06 22:28:01,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:01,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:28:01,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:01,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:28:01,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2023-11-06 22:28:01,794 INFO L87 Difference]: Start difference. First operand 336 states and 432 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-06 22:28:05,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:28:07,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:28:09,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:28:09,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:09,802 INFO L93 Difference]: Finished difference Result 368 states and 461 transitions. [2023-11-06 22:28:09,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:28:09,803 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 84 [2023-11-06 22:28:09,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:09,806 INFO L225 Difference]: With dead ends: 368 [2023-11-06 22:28:09,807 INFO L226 Difference]: Without dead ends: 361 [2023-11-06 22:28:09,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 85 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=139, Invalid=983, Unknown=0, NotChecked=0, Total=1122 [2023-11-06 22:28:09,808 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 108 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 15 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:09,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1282 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 478 Invalid, 3 Unknown, 0 Unchecked, 7.7s Time] [2023-11-06 22:28:09,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2023-11-06 22:28:09,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 271. [2023-11-06 22:28:09,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 186 states have (on average 1.1989247311827957) internal successors, (223), 191 states have internal predecessors, (223), 57 states have call successors, (57), 24 states have call predecessors, (57), 27 states have return successors, (63), 55 states have call predecessors, (63), 55 states have call successors, (63) [2023-11-06 22:28:09,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 343 transitions. [2023-11-06 22:28:09,846 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 343 transitions. Word has length 84 [2023-11-06 22:28:09,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:09,847 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 343 transitions. [2023-11-06 22:28:09,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-06 22:28:09,848 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 343 transitions. [2023-11-06 22:28:09,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-06 22:28:09,850 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:09,850 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2023-11-06 22:28:09,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:28:10,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-06 22:28:10,062 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:10,062 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:10,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1189823902, now seen corresponding path program 1 times [2023-11-06 22:28:10,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:10,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100137118] [2023-11-06 22:28:10,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:10,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:10,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:28:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:10,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:28:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:10,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:28:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:10,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:28:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:10,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:28:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:11,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:28:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:11,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:28:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:11,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-06 22:28:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:11,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:28:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:11,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:28:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-06 22:28:11,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:11,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100137118] [2023-11-06 22:28:11,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100137118] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:11,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:11,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:28:11,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864021577] [2023-11-06 22:28:11,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:11,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:28:11,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:11,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:28:11,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:28:11,213 INFO L87 Difference]: Start difference. First operand 271 states and 343 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-06 22:28:11,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:11,743 INFO L93 Difference]: Finished difference Result 411 states and 518 transitions. [2023-11-06 22:28:11,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:28:11,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 84 [2023-11-06 22:28:11,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:11,747 INFO L225 Difference]: With dead ends: 411 [2023-11-06 22:28:11,747 INFO L226 Difference]: Without dead ends: 264 [2023-11-06 22:28:11,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:28:11,749 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 59 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:11,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 309 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:28:11,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2023-11-06 22:28:11,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2023-11-06 22:28:11,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 178 states have (on average 1.196629213483146) internal successors, (213), 182 states have internal predecessors, (213), 57 states have call successors, (57), 24 states have call predecessors, (57), 26 states have return successors, (60), 55 states have call predecessors, (60), 55 states have call successors, (60) [2023-11-06 22:28:11,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 330 transitions. [2023-11-06 22:28:11,798 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 330 transitions. Word has length 84 [2023-11-06 22:28:11,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:11,799 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 330 transitions. [2023-11-06 22:28:11,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-06 22:28:11,799 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 330 transitions. [2023-11-06 22:28:11,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-06 22:28:11,802 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:11,802 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2023-11-06 22:28:11,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:28:11,803 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:11,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:11,803 INFO L85 PathProgramCache]: Analyzing trace with hash 295487979, now seen corresponding path program 1 times [2023-11-06 22:28:11,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:11,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648433539] [2023-11-06 22:28:11,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:11,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:13,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:28:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:13,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:28:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:13,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:28:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:13,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:28:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:13,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:28:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:13,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:28:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:13,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-06 22:28:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:13,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-06 22:28:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:13,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:28:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:13,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:28:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:13,837 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-06 22:28:13,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:13,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648433539] [2023-11-06 22:28:13,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648433539] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:13,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:13,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-06 22:28:13,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872667897] [2023-11-06 22:28:13,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:13,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:28:13,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:13,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:28:13,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:28:13,841 INFO L87 Difference]: Start difference. First operand 262 states and 330 transitions. Second operand has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-06 22:28:14,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:14,967 INFO L93 Difference]: Finished difference Result 279 states and 346 transitions. [2023-11-06 22:28:14,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:28:14,968 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 86 [2023-11-06 22:28:14,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:14,970 INFO L225 Difference]: With dead ends: 279 [2023-11-06 22:28:14,970 INFO L226 Difference]: Without dead ends: 241 [2023-11-06 22:28:14,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2023-11-06 22:28:14,972 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 84 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:14,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1043 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:28:14,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-11-06 22:28:14,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 230. [2023-11-06 22:28:14,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 158 states have (on average 1.1645569620253164) internal successors, (184), 162 states have internal predecessors, (184), 45 states have call successors, (45), 24 states have call predecessors, (45), 26 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2023-11-06 22:28:15,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 275 transitions. [2023-11-06 22:28:15,000 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 275 transitions. Word has length 86 [2023-11-06 22:28:15,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:15,000 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 275 transitions. [2023-11-06 22:28:15,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-06 22:28:15,001 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 275 transitions. [2023-11-06 22:28:15,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-06 22:28:15,002 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:15,003 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:15,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:28:15,003 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:15,004 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:15,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1406944127, now seen corresponding path program 1 times [2023-11-06 22:28:15,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:15,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474285836] [2023-11-06 22:28:15,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:15,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:15,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:28:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:15,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-06 22:28:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:16,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:28:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:16,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:28:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:16,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:28:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:16,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:28:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:16,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:28:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:16,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:28:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:16,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:28:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:16,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-06 22:28:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:16,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 22:28:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:16,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 22:28:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:16,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:28:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:16,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:28:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:16,620 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-06 22:28:16,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:16,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474285836] [2023-11-06 22:28:16,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474285836] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:28:16,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371477323] [2023-11-06 22:28:16,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:16,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:28:16,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:28:16,624 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:28:16,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 22:28:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:17,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 2628 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-06 22:28:17,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-11-06 22:28:17,509 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:28:17,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371477323] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:17,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:28:17,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 22 [2023-11-06 22:28:17,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153581596] [2023-11-06 22:28:17,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:17,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:28:17,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:17,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:28:17,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2023-11-06 22:28:17,512 INFO L87 Difference]: Start difference. First operand 230 states and 275 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 9 states have internal predecessors, (50), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2023-11-06 22:28:17,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:17,789 INFO L93 Difference]: Finished difference Result 300 states and 354 transitions. [2023-11-06 22:28:17,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:28:17,790 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 9 states have internal predecessors, (50), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) Word has length 97 [2023-11-06 22:28:17,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:17,792 INFO L225 Difference]: With dead ends: 300 [2023-11-06 22:28:17,793 INFO L226 Difference]: Without dead ends: 230 [2023-11-06 22:28:17,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2023-11-06 22:28:17,795 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 38 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:17,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1222 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:28:17,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-11-06 22:28:17,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2023-11-06 22:28:17,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 158 states have (on average 1.1518987341772151) internal successors, (182), 162 states have internal predecessors, (182), 45 states have call successors, (45), 24 states have call predecessors, (45), 26 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2023-11-06 22:28:17,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 273 transitions. [2023-11-06 22:28:17,829 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 273 transitions. Word has length 97 [2023-11-06 22:28:17,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:17,830 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 273 transitions. [2023-11-06 22:28:17,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 9 states have internal predecessors, (50), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2023-11-06 22:28:17,830 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 273 transitions. [2023-11-06 22:28:17,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-06 22:28:17,833 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:17,834 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:17,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:28:18,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-06 22:28:18,045 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:18,046 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:18,046 INFO L85 PathProgramCache]: Analyzing trace with hash 760529425, now seen corresponding path program 1 times [2023-11-06 22:28:18,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:18,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335836681] [2023-11-06 22:28:18,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:18,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:18,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:28:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:18,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-06 22:28:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:19,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:28:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:19,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:28:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:19,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:28:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:19,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:28:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:19,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:28:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:19,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:28:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:19,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:28:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:19,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-06 22:28:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:19,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 22:28:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:19,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 22:28:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:19,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:28:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:19,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:28:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:19,656 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-06 22:28:19,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:19,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335836681] [2023-11-06 22:28:19,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335836681] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:28:19,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70598491] [2023-11-06 22:28:19,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:19,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:28:19,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:28:19,659 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:28:19,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 22:28:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:20,294 INFO L262 TraceCheckSpWp]: Trace formula consists of 2622 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:28:20,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:20,519 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-11-06 22:28:20,520 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:28:20,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70598491] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:20,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:28:20,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 21 [2023-11-06 22:28:20,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111765746] [2023-11-06 22:28:20,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:20,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:28:20,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:20,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:28:20,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2023-11-06 22:28:20,524 INFO L87 Difference]: Start difference. First operand 230 states and 273 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2023-11-06 22:28:20,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:20,668 INFO L93 Difference]: Finished difference Result 346 states and 422 transitions. [2023-11-06 22:28:20,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:28:20,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 98 [2023-11-06 22:28:20,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:20,671 INFO L225 Difference]: With dead ends: 346 [2023-11-06 22:28:20,671 INFO L226 Difference]: Without dead ends: 250 [2023-11-06 22:28:20,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2023-11-06 22:28:20,673 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 8 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:20,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 663 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:28:20,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-11-06 22:28:20,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2023-11-06 22:28:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 170 states have (on average 1.1411764705882352) internal successors, (194), 174 states have internal predecessors, (194), 51 states have call successors, (51), 24 states have call predecessors, (51), 26 states have return successors, (54), 49 states have call predecessors, (54), 49 states have call successors, (54) [2023-11-06 22:28:20,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 299 transitions. [2023-11-06 22:28:20,705 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 299 transitions. Word has length 98 [2023-11-06 22:28:20,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:20,706 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 299 transitions. [2023-11-06 22:28:20,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2023-11-06 22:28:20,706 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 299 transitions. [2023-11-06 22:28:20,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-06 22:28:20,708 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:20,709 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 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] [2023-11-06 22:28:20,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:28:20,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-06 22:28:20,922 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:20,923 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:20,923 INFO L85 PathProgramCache]: Analyzing trace with hash 579357075, now seen corresponding path program 1 times [2023-11-06 22:28:20,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:20,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785923331] [2023-11-06 22:28:20,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:20,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:21,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:28:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:21,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-06 22:28:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:21,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:28:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:21,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:28:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:22,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:28:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:22,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:28:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:22,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:28:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:22,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:28:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:22,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:28:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:22,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-06 22:28:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:22,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 22:28:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:22,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 22:28:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:22,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:28:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:22,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:28:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:22,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:28:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:22,415 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-11-06 22:28:22,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:22,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785923331] [2023-11-06 22:28:22,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785923331] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:28:22,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247046580] [2023-11-06 22:28:22,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:22,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:28:22,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:28:22,417 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:28:22,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-06 22:28:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:23,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 2640 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-06 22:28:23,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:23,250 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-06 22:28:23,250 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:28:23,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247046580] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:23,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:28:23,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 22 [2023-11-06 22:28:23,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76547094] [2023-11-06 22:28:23,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:23,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:28:23,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:23,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:28:23,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2023-11-06 22:28:23,254 INFO L87 Difference]: Start difference. First operand 248 states and 299 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2023-11-06 22:28:23,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:23,479 INFO L93 Difference]: Finished difference Result 353 states and 415 transitions. [2023-11-06 22:28:23,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:28:23,480 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 105 [2023-11-06 22:28:23,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:23,482 INFO L225 Difference]: With dead ends: 353 [2023-11-06 22:28:23,482 INFO L226 Difference]: Without dead ends: 230 [2023-11-06 22:28:23,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2023-11-06 22:28:23,484 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 30 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:23,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1242 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:28:23,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-11-06 22:28:23,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2023-11-06 22:28:23,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 158 states have (on average 1.139240506329114) internal successors, (180), 162 states have internal predecessors, (180), 45 states have call successors, (45), 24 states have call predecessors, (45), 26 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2023-11-06 22:28:23,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 271 transitions. [2023-11-06 22:28:23,516 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 271 transitions. Word has length 105 [2023-11-06 22:28:23,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:23,517 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 271 transitions. [2023-11-06 22:28:23,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2023-11-06 22:28:23,518 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 271 transitions. [2023-11-06 22:28:23,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-06 22:28:23,520 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:23,520 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:23,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-06 22:28:23,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-06 22:28:23,732 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:23,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:23,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1720522272, now seen corresponding path program 1 times [2023-11-06 22:28:23,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:23,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997144080] [2023-11-06 22:28:23,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:23,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:24,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:28:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:24,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-06 22:28:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:24,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:28:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:24,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:28:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:24,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:28:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:24,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:28:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:24,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:28:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:24,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:28:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:24,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:28:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:24,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-06 22:28:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:24,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 22:28:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:24,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 22:28:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:24,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:28:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:24,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:28:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:24,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:28:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:24,472 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-06 22:28:24,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:24,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997144080] [2023-11-06 22:28:24,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997144080] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:24,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:24,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:28:24,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090851504] [2023-11-06 22:28:24,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:24,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:28:24,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:24,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:28:24,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:28:24,479 INFO L87 Difference]: Start difference. First operand 230 states and 271 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:28:24,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:24,942 INFO L93 Difference]: Finished difference Result 300 states and 350 transitions. [2023-11-06 22:28:24,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:28:24,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 107 [2023-11-06 22:28:24,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:24,946 INFO L225 Difference]: With dead ends: 300 [2023-11-06 22:28:24,946 INFO L226 Difference]: Without dead ends: 230 [2023-11-06 22:28:24,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:28:24,948 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 97 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:24,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 259 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:28:24,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-11-06 22:28:24,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2023-11-06 22:28:24,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 158 states have (on average 1.1265822784810127) internal successors, (178), 162 states have internal predecessors, (178), 45 states have call successors, (45), 24 states have call predecessors, (45), 26 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2023-11-06 22:28:24,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 269 transitions. [2023-11-06 22:28:24,992 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 269 transitions. Word has length 107 [2023-11-06 22:28:24,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:24,993 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 269 transitions. [2023-11-06 22:28:24,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:28:24,994 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 269 transitions. [2023-11-06 22:28:24,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-06 22:28:24,996 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:24,997 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:24,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:28:24,997 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:24,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:24,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1000442815, now seen corresponding path program 1 times [2023-11-06 22:28:24,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:24,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956398230] [2023-11-06 22:28:24,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:24,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:25,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:28:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:25,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-06 22:28:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:25,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:28:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:25,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:28:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:25,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:28:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:25,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:28:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:25,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:28:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:25,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:28:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:25,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:28:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:25,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-06 22:28:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:25,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 22:28:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:25,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 22:28:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:25,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:28:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:25,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:28:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:25,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:28:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:25,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:28:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:25,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:28:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:25,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-06 22:28:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:25,622 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2023-11-06 22:28:25,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:25,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956398230] [2023-11-06 22:28:25,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956398230] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:25,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:25,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:28:25,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49705062] [2023-11-06 22:28:25,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:25,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:28:25,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:25,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:28:25,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:28:25,625 INFO L87 Difference]: Start difference. First operand 230 states and 269 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-06 22:28:26,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:26,009 INFO L93 Difference]: Finished difference Result 326 states and 384 transitions. [2023-11-06 22:28:26,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:28:26,010 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 123 [2023-11-06 22:28:26,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:26,012 INFO L225 Difference]: With dead ends: 326 [2023-11-06 22:28:26,012 INFO L226 Difference]: Without dead ends: 230 [2023-11-06 22:28:26,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:28:26,013 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 97 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:26,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 180 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:28:26,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-11-06 22:28:26,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2023-11-06 22:28:26,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 158 states have (on average 1.1139240506329113) internal successors, (176), 162 states have internal predecessors, (176), 45 states have call successors, (45), 24 states have call predecessors, (45), 26 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2023-11-06 22:28:26,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 267 transitions. [2023-11-06 22:28:26,043 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 267 transitions. Word has length 123 [2023-11-06 22:28:26,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:26,044 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 267 transitions. [2023-11-06 22:28:26,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-06 22:28:26,044 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 267 transitions. [2023-11-06 22:28:26,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-06 22:28:26,046 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:26,046 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:26,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:28:26,047 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:26,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:26,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1057465539, now seen corresponding path program 1 times [2023-11-06 22:28:26,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:26,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881915923] [2023-11-06 22:28:26,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:26,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:26,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:28:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:26,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-06 22:28:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:26,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:28:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:26,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:28:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:26,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:28:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:26,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:28:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:26,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:28:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:26,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:28:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:26,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:28:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:26,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-06 22:28:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:26,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 22:28:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:26,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 22:28:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:26,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:28:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:26,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:28:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:26,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:28:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:26,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-06 22:28:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:26,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:28:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:26,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:28:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:26,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-06 22:28:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:27,007 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2023-11-06 22:28:27,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:27,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881915923] [2023-11-06 22:28:27,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881915923] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:27,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:27,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:28:27,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031987343] [2023-11-06 22:28:27,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:27,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:28:27,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:27,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:28:27,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:28:27,011 INFO L87 Difference]: Start difference. First operand 230 states and 267 transitions. Second operand has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-06 22:28:27,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:27,490 INFO L93 Difference]: Finished difference Result 334 states and 390 transitions. [2023-11-06 22:28:27,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:28:27,491 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 130 [2023-11-06 22:28:27,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:27,492 INFO L225 Difference]: With dead ends: 334 [2023-11-06 22:28:27,492 INFO L226 Difference]: Without dead ends: 230 [2023-11-06 22:28:27,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:28:27,494 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 69 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:27,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 267 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:28:27,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-11-06 22:28:27,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2023-11-06 22:28:27,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 158 states have (on average 1.1012658227848102) internal successors, (174), 162 states have internal predecessors, (174), 45 states have call successors, (45), 24 states have call predecessors, (45), 26 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2023-11-06 22:28:27,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 265 transitions. [2023-11-06 22:28:27,522 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 265 transitions. Word has length 130 [2023-11-06 22:28:27,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:27,522 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 265 transitions. [2023-11-06 22:28:27,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-06 22:28:27,523 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 265 transitions. [2023-11-06 22:28:27,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-06 22:28:27,525 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:27,525 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:27,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:28:27,526 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:27,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:27,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1919466878, now seen corresponding path program 1 times [2023-11-06 22:28:27,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:27,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969602410] [2023-11-06 22:28:27,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:27,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:28,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:28:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:28,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-06 22:28:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:28,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:28:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:28,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:28:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:28,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:28:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:28,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:28:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:28,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:28:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:28,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:28:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:28,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:28:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:28,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-06 22:28:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:28,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 22:28:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:28,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 22:28:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:28,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:28:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:28,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:28:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:28,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-06 22:28:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:28,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-06 22:28:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:28,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:28:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:28,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:28:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:28,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-06 22:28:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:28,299 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2023-11-06 22:28:28,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:28,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969602410] [2023-11-06 22:28:28,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969602410] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:28:28,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:28:28,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:28:28,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115170187] [2023-11-06 22:28:28,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:28:28,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:28:28,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:28,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:28:28,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:28:28,302 INFO L87 Difference]: Start difference. First operand 230 states and 265 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-06 22:28:28,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:28,767 INFO L93 Difference]: Finished difference Result 306 states and 350 transitions. [2023-11-06 22:28:28,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:28:28,768 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 132 [2023-11-06 22:28:28,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:28,772 INFO L225 Difference]: With dead ends: 306 [2023-11-06 22:28:28,772 INFO L226 Difference]: Without dead ends: 230 [2023-11-06 22:28:28,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:28:28,774 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 97 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:28,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 380 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:28:28,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-11-06 22:28:28,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2023-11-06 22:28:28,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 158 states have (on average 1.0886075949367089) internal successors, (172), 162 states have internal predecessors, (172), 45 states have call successors, (45), 24 states have call predecessors, (45), 26 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2023-11-06 22:28:28,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 263 transitions. [2023-11-06 22:28:28,803 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 263 transitions. Word has length 132 [2023-11-06 22:28:28,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:28,806 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 263 transitions. [2023-11-06 22:28:28,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-06 22:28:28,806 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 263 transitions. [2023-11-06 22:28:28,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-06 22:28:28,808 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:28:28,808 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:28,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 22:28:28,809 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:28:28,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:28:28,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1523548186, now seen corresponding path program 1 times [2023-11-06 22:28:28,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:28:28,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001487797] [2023-11-06 22:28:28,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:28,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:28:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:30,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:28:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:30,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-06 22:28:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:30,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:28:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:30,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:28:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:31,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:28:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:31,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:28:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:31,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:28:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:31,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 22:28:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:31,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:28:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:31,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-06 22:28:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:31,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 22:28:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:31,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 22:28:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:31,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 22:28:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:31,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 22:28:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:31,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-06 22:28:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:31,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-06 22:28:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:31,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:28:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:31,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:28:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:31,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-06 22:28:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:31,405 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-11-06 22:28:31,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:28:31,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001487797] [2023-11-06 22:28:31,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001487797] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:28:31,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579500501] [2023-11-06 22:28:31,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:28:31,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:28:31,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:28:31,408 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:28:31,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-06 22:28:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:28:32,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 2735 conjuncts, 101 conjunts are in the unsatisfiable core [2023-11-06 22:28:32,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:28:37,943 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 62 proven. 9 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-11-06 22:28:37,943 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:28:40,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579500501] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:28:40,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:28:40,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 34] total 44 [2023-11-06 22:28:40,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2372479] [2023-11-06 22:28:40,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:28:40,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-06 22:28:40,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:28:40,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-06 22:28:40,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2992, Unknown=0, NotChecked=0, Total=3192 [2023-11-06 22:28:40,809 INFO L87 Difference]: Start difference. First operand 230 states and 263 transitions. Second operand has 44 states, 38 states have (on average 3.1315789473684212) internal successors, (119), 33 states have internal predecessors, (119), 15 states have call successors, (39), 7 states have call predecessors, (39), 11 states have return successors, (37), 15 states have call predecessors, (37), 14 states have call successors, (37) [2023-11-06 22:28:44,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:28:44,792 INFO L93 Difference]: Finished difference Result 230 states and 263 transitions. [2023-11-06 22:28:44,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:28:44,801 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 38 states have (on average 3.1315789473684212) internal successors, (119), 33 states have internal predecessors, (119), 15 states have call successors, (39), 7 states have call predecessors, (39), 11 states have return successors, (37), 15 states have call predecessors, (37), 14 states have call successors, (37) Word has length 133 [2023-11-06 22:28:44,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:28:44,801 INFO L225 Difference]: With dead ends: 230 [2023-11-06 22:28:44,801 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:28:44,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 140 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=284, Invalid=4408, Unknown=0, NotChecked=0, Total=4692 [2023-11-06 22:28:44,812 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 52 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:28:44,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 470 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 761 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2023-11-06 22:28:44,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:28:44,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:28:44,820 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) [2023-11-06 22:28:44,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:28:44,820 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 133 [2023-11-06 22:28:44,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:28:44,821 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:28:44,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 38 states have (on average 3.1315789473684212) internal successors, (119), 33 states have internal predecessors, (119), 15 states have call successors, (39), 7 states have call predecessors, (39), 11 states have return successors, (37), 15 states have call predecessors, (37), 14 states have call successors, (37) [2023-11-06 22:28:44,821 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:28:44,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:28:44,827 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:28:44,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-06 22:28:45,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:28:45,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:28:47,326 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6800 6804) no Hoare annotation was computed. [2023-11-06 22:28:47,327 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20|) 8) 0)) (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)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20|) 8)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| 8))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse0) 0) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse0) 0)))) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (<= .cse1 (* 18446744073709551616 (div .cse1 18446744073709551616)))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (let ((.cse2 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (< (* 18446744073709551616 (div .cse2 18446744073709551616)) .cse2))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| 8))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse3) 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse3) 0))))) (<= |#StackHeapBarrier| 0)) [2023-11-06 22:28:47,327 INFO L899 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2023-11-06 22:28:47,327 INFO L895 garLoopResultBuilder]: At program point ensure_string_is_allocated_returnLabel#1(lines 6806 6816) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20|) 8) 0)) (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)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 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)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (< (* 18446744073709551616 (div .cse0 18446744073709551616)) .cse0))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| 8))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse1) 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse1) 0))))) (<= |#StackHeapBarrier| 0)) [2023-11-06 22:28:47,328 INFO L895 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20|) 8) 0)) (let ((.cse0 (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|)) (or (< 0 (+ (div |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| 18446744073709551616) (div (+ (* (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 15) 18446744073709551616) 1)) .cse0) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (< 0 (+ (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616) (div (+ 15 (* (- 1) |ensure_string_is_allocated_bounded_length_~len~1#1|)) 18446744073709551616) 1)) .cse0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (< (* 18446744073709551616 (div .cse1 18446744073709551616)) .cse1))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| 8))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse2) 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse2) 0))))) (<= |#StackHeapBarrier| 0)) [2023-11-06 22:28:47,328 INFO L899 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2023-11-06 22:28:47,329 INFO L895 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20|) 8) 0)) (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)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20|) 8)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| 8))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse0) 0) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse0) 0)))) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (<= .cse1 (* 18446744073709551616 (div .cse1 18446744073709551616)))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (let ((.cse2 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (< (* 18446744073709551616 (div .cse2 18446744073709551616)) .cse2))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| 8))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse3) 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse3) 0))))) (<= |#StackHeapBarrier| 0)) [2023-11-06 22:28:47,329 INFO L899 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2023-11-06 22:28:47,330 INFO L895 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20|) 8) 0)) (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|)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (< (* 18446744073709551616 (div .cse0 18446744073709551616)) .cse0))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| 8))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse1) 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse1) 0))))) (<= |#StackHeapBarrier| 0)) [2023-11-06 22:28:47,330 INFO L899 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2023-11-06 22:28:47,330 INFO L899 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2023-11-06 22:28:47,330 INFO L895 garLoopResultBuilder]: At program point L6801(line 6801) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20|) 8) 0)) (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|)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (< (* 18446744073709551616 (div .cse0 18446744073709551616)) .cse0))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| 8))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse1) 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse1) 0))))) (<= |#StackHeapBarrier| 0)) [2023-11-06 22:28:47,330 INFO L899 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2023-11-06 22:28:47,331 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 6800 6804) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20|) 8) 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (< (* 18446744073709551616 (div .cse0 18446744073709551616)) .cse0))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| 8))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse1) 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse1) 0))))) (<= |#StackHeapBarrier| 0)) [2023-11-06 22:28:47,331 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6800 6804) no Hoare annotation was computed. [2023-11-06 22:28:47,331 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2023-11-06 22:28:47,331 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 6882 6887) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| 8))) (or (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse0) 0)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse0) 0))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (< (* 18446744073709551616 (div .cse1 18446744073709551616)) .cse1))) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20| Int)) (= 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20|) 8))) (<= |#StackHeapBarrier| 0)) [2023-11-06 22:28:47,332 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2023-11-06 22:28:47,332 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2023-11-06 22:28:47,332 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| 8))) (or (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse0) 0)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse0) 0))))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (< (* 18446744073709551616 (div .cse1 18446744073709551616)) .cse1))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20| Int)) (= 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20|) 8))) (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (<= |#StackHeapBarrier| 0)) [2023-11-06 22:28:47,332 INFO L899 garLoopResultBuilder]: For program point L7697(lines 7697 7701) no Hoare annotation was computed. [2023-11-06 22:28:47,332 INFO L899 garLoopResultBuilder]: For program point aws_array_eqEXIT(lines 7684 7704) no Hoare annotation was computed. [2023-11-06 22:28:47,333 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7684 7704) the Hoare annotation is: true [2023-11-06 22:28:47,333 INFO L902 garLoopResultBuilder]: At program point L7686(line 7686) the Hoare annotation is: true [2023-11-06 22:28:47,333 INFO L899 garLoopResultBuilder]: For program point L7688(lines 7685 7704) no Hoare annotation was computed. [2023-11-06 22:28:47,333 INFO L899 garLoopResultBuilder]: For program point aws_array_eqFINAL(lines 7684 7704) no Hoare annotation was computed. [2023-11-06 22:28:47,333 INFO L902 garLoopResultBuilder]: At program point L7686-1(line 7686) the Hoare annotation is: true [2023-11-06 22:28:47,333 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2023-11-06 22:28:47,334 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2023-11-06 22:28:47,334 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 261) the Hoare annotation is: true [2023-11-06 22:28:47,334 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2023-11-06 22:28:47,334 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 210 212) the Hoare annotation is: true [2023-11-06 22:28:47,334 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2023-11-06 22:28:47,334 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2023-11-06 22:28:47,334 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2023-11-06 22:28:47,334 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 6889 6891) the Hoare annotation is: true [2023-11-06 22:28:47,334 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2023-11-06 22:28:47,335 INFO L899 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2023-11-06 22:28:47,335 INFO L899 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2023-11-06 22:28:47,335 INFO L899 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2023-11-06 22:28:47,335 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2023-11-06 22:28:47,335 INFO L899 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2023-11-06 22:28:47,335 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 6252 6257) the Hoare annotation is: true [2023-11-06 22:28:47,335 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2023-11-06 22:28:47,336 INFO L899 garLoopResultBuilder]: For program point L7371(line 7371) no Hoare annotation was computed. [2023-11-06 22:28:47,336 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7368 7372) the Hoare annotation is: true [2023-11-06 22:28:47,336 INFO L899 garLoopResultBuilder]: For program point L7371-5(line 7371) no Hoare annotation was computed. [2023-11-06 22:28:47,336 INFO L899 garLoopResultBuilder]: For program point L7371-4(line 7371) no Hoare annotation was computed. [2023-11-06 22:28:47,336 INFO L899 garLoopResultBuilder]: For program point L7371-2(line 7371) no Hoare annotation was computed. [2023-11-06 22:28:47,336 INFO L899 garLoopResultBuilder]: For program point L7371-8(line 7371) no Hoare annotation was computed. [2023-11-06 22:28:47,337 INFO L899 garLoopResultBuilder]: For program point L7371-6(line 7371) no Hoare annotation was computed. [2023-11-06 22:28:47,337 INFO L899 garLoopResultBuilder]: For program point aws_byte_cursor_is_validEXIT(lines 7368 7372) no Hoare annotation was computed. [2023-11-06 22:28:47,337 INFO L899 garLoopResultBuilder]: For program point L7371-11(line 7371) no Hoare annotation was computed. [2023-11-06 22:28:47,337 INFO L899 garLoopResultBuilder]: For program point L7371-10(line 7371) no Hoare annotation was computed. [2023-11-06 22:28:47,337 INFO L899 garLoopResultBuilder]: For program point L7370(lines 7370 7371) no Hoare annotation was computed. [2023-11-06 22:28:47,337 INFO L899 garLoopResultBuilder]: For program point L7370-2(lines 7370 7371) no Hoare annotation was computed. [2023-11-06 22:28:47,337 INFO L899 garLoopResultBuilder]: For program point aws_byte_cursor_is_validFINAL(lines 7368 7372) no Hoare annotation was computed. [2023-11-06 22:28:47,338 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2023-11-06 22:28:47,338 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2023-11-06 22:28:47,338 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 266) the Hoare annotation is: true [2023-11-06 22:28:47,338 INFO L899 garLoopResultBuilder]: For program point L6675-1(line 6675) no Hoare annotation was computed. [2023-11-06 22:28:47,338 INFO L895 garLoopResultBuilder]: At program point L6675(line 6675) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20|) 8)))) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (<= .cse0 (* 18446744073709551616 (div .cse0 18446744073709551616))))) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0) (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) [2023-11-06 22:28:47,339 INFO L899 garLoopResultBuilder]: For program point L9549(lines 9549 9559) no Hoare annotation was computed. [2023-11-06 22:28:47,339 INFO L895 garLoopResultBuilder]: At program point L9549-1(lines 9549 9559) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse1 (<= 1 |#StackHeapBarrier|)) (.cse2 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|))) (or (and .cse0 .cse1 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse2) (and .cse0 .cse1 (let ((.cse3 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 0))) (<= .cse3 (* 18446744073709551616 (div .cse3 18446744073709551616)))) .cse2))) [2023-11-06 22:28:47,339 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(line 9562) the Hoare annotation is: true [2023-11-06 22:28:47,339 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:28:47,339 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2023-11-06 22:28:47,339 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2023-11-06 22:28:47,340 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:28:47,340 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2023-11-06 22:28:47,340 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2023-11-06 22:28:47,340 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2023-11-06 22:28:47,340 INFO L895 garLoopResultBuilder]: At program point L9560(line 9560) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1363#1| 1) (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) [2023-11-06 22:28:47,340 INFO L899 garLoopResultBuilder]: For program point L9560-1(line 9560) no Hoare annotation was computed. [2023-11-06 22:28:47,341 INFO L895 garLoopResultBuilder]: At program point L9329-4(line 9329) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse1 (<= 1 |#StackHeapBarrier|)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse4 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (or (and .cse0 .cse1 .cse2 (let ((.cse3 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 0))) (<= .cse3 (* 18446744073709551616 (div .cse3 18446744073709551616)))) .cse4 .cse5) (and .cse0 .cse1 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse2 .cse4 .cse5))) [2023-11-06 22:28:47,341 INFO L899 garLoopResultBuilder]: For program point L9329-5(line 9329) no Hoare annotation was computed. [2023-11-06 22:28:47,341 INFO L899 garLoopResultBuilder]: For program point L9329(line 9329) no Hoare annotation was computed. [2023-11-06 22:28:47,341 INFO L895 garLoopResultBuilder]: At program point L9552(line 9552) the Hoare annotation is: false [2023-11-06 22:28:47,341 INFO L895 garLoopResultBuilder]: At program point L9329-2(line 9329) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse1 (<= 1 |#StackHeapBarrier|)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse4 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (or (and .cse0 .cse1 .cse2 (let ((.cse3 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 0))) (<= .cse3 (* 18446744073709551616 (div .cse3 18446744073709551616)))) .cse4 .cse5) (and .cse0 .cse1 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse2 .cse4 .cse5))) [2023-11-06 22:28:47,341 INFO L895 garLoopResultBuilder]: At program point L9552-1(line 9552) the Hoare annotation is: false [2023-11-06 22:28:47,342 INFO L899 garLoopResultBuilder]: For program point L9329-3(line 9329) no Hoare annotation was computed. [2023-11-06 22:28:47,342 INFO L899 garLoopResultBuilder]: For program point L9552-2(line 9552) no Hoare annotation was computed. [2023-11-06 22:28:47,342 INFO L895 garLoopResultBuilder]: At program point L9544(line 9544) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse1 (<= 1 |#StackHeapBarrier|)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse3 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (or (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0) .cse2 .cse3 .cse4) (and .cse0 .cse1 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse2 .cse3 .cse4))) [2023-11-06 22:28:47,342 INFO L895 garLoopResultBuilder]: At program point L9544-1(line 9544) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse1 (<= 1 |#StackHeapBarrier|)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse2 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1354#1| 0) .cse2) (and .cse0 .cse1 .cse3 (let ((.cse4 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 0))) (<= .cse4 (* 18446744073709551616 (div .cse4 18446744073709551616)))) .cse2 .cse5) (and .cse0 .cse1 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse3 .cse2 .cse5))) [2023-11-06 22:28:47,342 INFO L899 garLoopResultBuilder]: For program point L9544-2(line 9544) no Hoare annotation was computed. [2023-11-06 22:28:47,343 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2023-11-06 22:28:47,343 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2023-11-06 22:28:47,343 INFO L899 garLoopResultBuilder]: For program point L9330(line 9330) no Hoare annotation was computed. [2023-11-06 22:28:47,343 INFO L899 garLoopResultBuilder]: For program point L9330-5(line 9330) no Hoare annotation was computed. [2023-11-06 22:28:47,343 INFO L899 garLoopResultBuilder]: For program point L9553(lines 9553 9558) no Hoare annotation was computed. [2023-11-06 22:28:47,343 INFO L895 garLoopResultBuilder]: At program point L9330-2(line 9330) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse1 (<= 1 |#StackHeapBarrier|)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse4 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (or (and .cse0 .cse1 .cse2 (let ((.cse3 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 0))) (<= .cse3 (* 18446744073709551616 (div .cse3 18446744073709551616)))) .cse4 .cse5) (and .cse0 .cse1 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse2 .cse4 .cse5))) [2023-11-06 22:28:47,344 INFO L899 garLoopResultBuilder]: For program point L9330-3(line 9330) no Hoare annotation was computed. [2023-11-06 22:28:47,344 INFO L895 garLoopResultBuilder]: At program point L9330-4(line 9330) the Hoare annotation is: (let ((.cse10 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base| 0)) (.cse3 (not .cse10)) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0))) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset| 0)) (.cse8 (let ((.cse11 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 0))) (<= .cse11 (* 18446744073709551616 (div .cse11 18446744073709551616))))) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse2 (<= 1 |#StackHeapBarrier|)) (.cse6 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0))) (.cse9 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse7 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0) .cse3 .cse4 .cse5 .cse8 .cse7) (and .cse1 .cse2 .cse9 .cse8 .cse7 .cse10) (and .cse1 .cse2 .cse6 .cse9 .cse7 .cse10)))) [2023-11-06 22:28:47,344 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:28:47,344 INFO L899 garLoopResultBuilder]: For program point L9537(lines 9537 9561) no Hoare annotation was computed. [2023-11-06 22:28:47,344 INFO L899 garLoopResultBuilder]: For program point L9331(lines 9331 9339) no Hoare annotation was computed. [2023-11-06 22:28:47,345 INFO L895 garLoopResultBuilder]: At program point L9554(line 9554) the Hoare annotation is: false [2023-11-06 22:28:47,345 INFO L899 garLoopResultBuilder]: For program point L6672(lines 6672 6676) no Hoare annotation was computed. [2023-11-06 22:28:47,345 INFO L899 garLoopResultBuilder]: For program point L9554-1(line 9554) no Hoare annotation was computed. [2023-11-06 22:28:47,345 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2023-11-06 22:28:47,345 INFO L895 garLoopResultBuilder]: At program point L9538(line 9538) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20|) 8)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| 8))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse0) 0) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (<= .cse1 (* 18446744073709551616 (div .cse1 18446744073709551616)))))) [2023-11-06 22:28:47,345 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2023-11-06 22:28:47,346 INFO L899 garLoopResultBuilder]: For program point L9538-5(lines 9538 9539) no Hoare annotation was computed. [2023-11-06 22:28:47,346 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:28:47,346 INFO L899 garLoopResultBuilder]: For program point L9340(lines 9340 9348) no Hoare annotation was computed. [2023-11-06 22:28:47,346 INFO L899 garLoopResultBuilder]: For program point L9538-1(lines 9538 9539) no Hoare annotation was computed. [2023-11-06 22:28:47,346 INFO L895 garLoopResultBuilder]: At program point L9538-2(line 9538) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20|) 8)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| 8))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse0) 0) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse0) 0)))) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (<= .cse1 (* 18446744073709551616 (div .cse1 18446744073709551616)))))) [2023-11-06 22:28:47,347 INFO L899 garLoopResultBuilder]: For program point L9538-3(line 9538) no Hoare annotation was computed. [2023-11-06 22:28:47,347 INFO L899 garLoopResultBuilder]: For program point L9555(lines 9555 9557) no Hoare annotation was computed. [2023-11-06 22:28:47,347 INFO L899 garLoopResultBuilder]: For program point L6673-3(lines 6673 6675) no Hoare annotation was computed. [2023-11-06 22:28:47,347 INFO L899 garLoopResultBuilder]: For program point L6673-1(lines 6673 6675) no Hoare annotation was computed. [2023-11-06 22:28:47,347 INFO L895 garLoopResultBuilder]: At program point L6673(line 6673) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20| Int)) (not (= 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20|) 8)))) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (exists ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (<= .cse0 (* 18446744073709551616 (div .cse0 18446744073709551616))))) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0) (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) [2023-11-06 22:28:47,348 INFO L895 garLoopResultBuilder]: At program point L9349(line 9349) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse1 (<= 1 |#StackHeapBarrier|)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse4 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (or (and .cse0 .cse1 .cse2 (let ((.cse3 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 0))) (<= .cse3 (* 18446744073709551616 (div .cse3 18446744073709551616)))) .cse4 .cse5) (and .cse0 .cse1 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse2 .cse4 .cse5))) [2023-11-06 22:28:47,348 INFO L899 garLoopResultBuilder]: For program point L9349-1(line 9349) no Hoare annotation was computed. [2023-11-06 22:28:47,348 INFO L895 garLoopResultBuilder]: At program point L9548(line 9548) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse1 (<= 1 |#StackHeapBarrier|)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse4 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (or (and .cse0 .cse1 .cse2 (let ((.cse3 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 0))) (<= .cse3 (* 18446744073709551616 (div .cse3 18446744073709551616)))) .cse4 .cse5) (and .cse0 .cse1 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse2 .cse4 .cse5))) [2023-11-06 22:28:47,348 INFO L899 garLoopResultBuilder]: For program point L9548-1(line 9548) no Hoare annotation was computed. [2023-11-06 22:28:47,348 INFO L895 garLoopResultBuilder]: At program point aws_string_eq_byte_cursor_returnLabel#1(lines 9327 9350) the Hoare annotation is: (let ((.cse8 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (let ((.cse5 (let ((.cse10 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 0))) (<= .cse10 (* 18446744073709551616 (div .cse10 18446744073709551616))))) (.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_#res#1| 0)) (.cse3 (not .cse8)) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0))) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse2 (<= 1 |#StackHeapBarrier|)) (.cse9 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0))) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse6 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|))) (or (and .cse0 .cse1 .cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0) .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse7 .cse5 .cse6 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse6) (and .cse1 .cse2 .cse9 .cse7 .cse6 .cse8)))) [2023-11-06 22:28:47,349 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2023-11-06 22:28:47,349 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2023-11-06 22:28:47,349 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2023-11-06 22:28:47,349 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2023-11-06 22:28:47,349 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 222 224) the Hoare annotation is: true [2023-11-06 22:28:47,349 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2023-11-06 22:28:47,352 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:28:47,354 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:28:47,363 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20 : int :: old(#memory_$Pointer$.base)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20][8] == 0) could not be translated [2023-11-06 22:28:47,367 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:28:47,367 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5 : int :: 18446744073709551616 * (old(#memory_int)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5][0] / 18446744073709551616) < old(#memory_int)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5][0]) could not be translated [2023-11-06 22:28:47,367 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17 : int, v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15 : int :: !(old(#memory_$Pointer$.base)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17][v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15 + 8] == 0) || !(old(#memory_$Pointer$.offset)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17][v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15 + 8] == 0)) could not be translated [2023-11-06 22:28:47,368 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20 : int :: old(#memory_$Pointer$.base)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20][8] == 0) could not be translated [2023-11-06 22:28:47,368 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:28:47,369 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5 : int :: 18446744073709551616 * (old(#memory_int)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5][0] / 18446744073709551616) < old(#memory_int)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5][0]) could not be translated [2023-11-06 22:28:47,369 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17 : int, v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15 : int :: !(old(#memory_$Pointer$.base)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17][v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15 + 8] == 0) || !(old(#memory_$Pointer$.offset)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17][v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15 + 8] == 0)) could not be translated [2023-11-06 22:28:47,369 ERROR L462 ceAbstractionStarter]: Failed to backtranslate (or (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20| Int)) (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20|) 8) 0)) (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)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 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)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| 0)) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select (select |old(#memory_int)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5|) 0))) (< (* 18446744073709551616 (div .cse0 18446744073709551616)) .cse0))) (forall ((|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15| 8))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse1) 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17|) .cse1) 0))))) (<= |#StackHeapBarrier| 0)) [2023-11-06 22:28:47,371 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#cursor~2!base] could not be translated [2023-11-06 22:28:47,371 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#cursor~2!base][8] could not be translated [2023-11-06 22:28:47,372 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base] could not be translated [2023-11-06 22:28:47,372 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base][0] could not be translated [2023-11-06 22:28:47,372 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base] could not be translated [2023-11-06 22:28:47,372 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base][0] could not be translated [2023-11-06 22:28:47,373 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base] could not be translated [2023-11-06 22:28:47,373 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base][0] could not be translated [2023-11-06 22:28:47,373 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base] could not be translated [2023-11-06 22:28:47,373 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base][0] could not be translated [2023-11-06 22:28:47,373 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#cursor~2!base] could not be translated [2023-11-06 22:28:47,374 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#cursor~2!base][8] could not be translated [2023-11-06 22:28:47,374 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#cursor~2!base] could not be translated [2023-11-06 22:28:47,374 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#cursor~2!base][8] could not be translated [2023-11-06 22:28:47,376 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#cursor~2!base] could not be translated [2023-11-06 22:28:47,376 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#cursor~2!base][8] could not be translated [2023-11-06 22:28:47,376 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base] could not be translated [2023-11-06 22:28:47,376 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base][0] could not be translated [2023-11-06 22:28:47,377 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base] could not be translated [2023-11-06 22:28:47,377 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base][0] could not be translated [2023-11-06 22:28:47,377 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base] could not be translated [2023-11-06 22:28:47,377 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base][0] could not be translated [2023-11-06 22:28:47,377 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base] could not be translated [2023-11-06 22:28:47,378 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base][0] could not be translated [2023-11-06 22:28:47,378 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#cursor~2!base] could not be translated [2023-11-06 22:28:47,378 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#cursor~2!base][8] could not be translated [2023-11-06 22:28:47,379 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#cursor~2!base] could not be translated [2023-11-06 22:28:47,379 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#cursor~2!base][8] could not be translated [2023-11-06 22:28:47,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:28:47 BoogieIcfgContainer [2023-11-06 22:28:47,380 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:28:47,380 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:28:47,381 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:28:47,381 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:28:47,381 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:27" (3/4) ... [2023-11-06 22:28:47,383 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:28:47,388 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2023-11-06 22:28:47,388 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2023-11-06 22:28:47,388 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_cursor_is_valid [2023-11-06 22:28:47,388 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_eq [2023-11-06 22:28:47,389 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2023-11-06 22:28:47,389 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2023-11-06 22:28:47,389 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:28:47,389 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-06 22:28:47,389 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2023-11-06 22:28:47,390 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2023-11-06 22:28:47,407 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 124 nodes and edges [2023-11-06 22:28:47,409 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 57 nodes and edges [2023-11-06 22:28:47,411 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2023-11-06 22:28:47,414 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-06 22:28:47,416 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-06 22:28:47,418 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:28:47,420 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-06 22:28:47,422 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:28:47,464 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 0) && !((str == 0))) && !((str == 0))) && (2 <= cursor)) || ((2 <= cursor) && (str == 0))) || ((((\result == 0) && !((str == 0))) && !((str == 0))) && (2 <= cursor))) || ((2 <= cursor) && (str == 0))) [2023-11-06 22:28:47,981 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 0) && !((str == 0))) && !((str == 0))) && (2 <= cursor)) || ((2 <= cursor) && (str == 0))) || ((((\result == 0) && !((str == 0))) && !((str == 0))) && (2 <= cursor))) || ((2 <= cursor) && (str == 0))) [2023-11-06 22:28:48,019 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:28:48,020 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:28:48,020 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:28:48,025 INFO L158 Benchmark]: Toolchain (without parser) took 87507.59ms. Allocated memory was 157.3MB in the beginning and 947.9MB in the end (delta: 790.6MB). Free memory was 101.4MB in the beginning and 869.4MB in the end (delta: -768.0MB). Peak memory consumption was 281.0MB. Max. memory is 16.1GB. [2023-11-06 22:28:48,026 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 157.3MB. Free memory is still 103.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:28:48,026 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3893.41ms. Allocated memory was 157.3MB in the beginning and 218.1MB in the end (delta: 60.8MB). Free memory was 101.0MB in the beginning and 102.6MB in the end (delta: -1.6MB). Peak memory consumption was 82.8MB. Max. memory is 16.1GB. [2023-11-06 22:28:48,032 INFO L158 Benchmark]: Boogie Procedure Inliner took 260.33ms. Allocated memory is still 218.1MB. Free memory was 102.6MB in the beginning and 90.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:28:48,032 INFO L158 Benchmark]: Boogie Preprocessor took 205.89ms. Allocated memory is still 218.1MB. Free memory was 90.0MB in the beginning and 153.6MB in the end (delta: -63.6MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2023-11-06 22:28:48,033 INFO L158 Benchmark]: RCFGBuilder took 2266.71ms. Allocated memory was 218.1MB in the beginning and 285.2MB in the end (delta: 67.1MB). Free memory was 153.6MB in the beginning and 144.3MB in the end (delta: 9.3MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2023-11-06 22:28:48,036 INFO L158 Benchmark]: TraceAbstraction took 80233.29ms. Allocated memory was 285.2MB in the beginning and 947.9MB in the end (delta: 662.7MB). Free memory was 144.3MB in the beginning and 745.4MB in the end (delta: -601.1MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. [2023-11-06 22:28:48,037 INFO L158 Benchmark]: Witness Printer took 639.36ms. Allocated memory is still 947.9MB. Free memory was 745.4MB in the beginning and 869.4MB in the end (delta: -124.0MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. [2023-11-06 22:28:48,041 INFO L338 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 157.3MB. Free memory is still 103.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3893.41ms. Allocated memory was 157.3MB in the beginning and 218.1MB in the end (delta: 60.8MB). Free memory was 101.0MB in the beginning and 102.6MB in the end (delta: -1.6MB). Peak memory consumption was 82.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 260.33ms. Allocated memory is still 218.1MB. Free memory was 102.6MB in the beginning and 90.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 205.89ms. Allocated memory is still 218.1MB. Free memory was 90.0MB in the beginning and 153.6MB in the end (delta: -63.6MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2266.71ms. Allocated memory was 218.1MB in the beginning and 285.2MB in the end (delta: 67.1MB). Free memory was 153.6MB in the beginning and 144.3MB in the end (delta: 9.3MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. * TraceAbstraction took 80233.29ms. Allocated memory was 285.2MB in the beginning and 947.9MB in the end (delta: 662.7MB). Free memory was 144.3MB in the beginning and 745.4MB in the end (delta: -601.1MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. * Witness Printer took 639.36ms. Allocated memory is still 947.9MB. Free memory was 745.4MB in the beginning and 869.4MB in the end (delta: -124.0MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 8253]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8253] - GenericResultAtLocation [Line: 8739]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8739-8750] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20 : int :: old(#memory_$Pointer$.base)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20][8] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5 : int :: 18446744073709551616 * (old(#memory_int)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5][0] / 18446744073709551616) < old(#memory_int)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5][0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17 : int, v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15 : int :: !(old(#memory_$Pointer$.base)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17][v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15 + 8] == 0) || !(old(#memory_$Pointer$.offset)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17][v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15 + 8] == 0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20 : int :: old(#memory_$Pointer$.base)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20][8] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5 : int :: 18446744073709551616 * (old(#memory_int)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5][0] / 18446744073709551616) < old(#memory_int)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5][0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17 : int, v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15 : int :: !(old(#memory_$Pointer$.base)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17][v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15 + 8] == 0) || !(old(#memory_$Pointer$.offset)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17][v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15 + 8] == 0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#cursor~2!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#cursor~2!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#cursor~2!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#cursor~2!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#cursor~2!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#cursor~2!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#cursor~2!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#cursor~2!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#cursor~2!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#cursor~2!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#cursor~2!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#cursor~2!base][8] could not be translated * 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]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 80.1s, OverallIterations: 20, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 22.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 1493 SdHoareTripleChecker+Valid, 19.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1376 mSDsluCounter, 14738 SdHoareTripleChecker+Invalid, 18.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12223 mSDsCounter, 406 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5513 IncrementalHoareTripleChecker+Invalid, 5923 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 406 mSolverCounterUnsat, 2515 mSDtfsCounter, 5513 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1839 GetRequests, 1492 SyntacticMatches, 26 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1853 ImplicationChecksByTransitivity, 11.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=436occurred in iteration=8, InterpolantAutomatonStates: 180, 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, 20 MinimizatonAttempts, 162 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 42 LocationsWithAnnotation, 523 PreInvPairs, 562 NumberOfFragments, 1707 HoareAnnotationTreeSize, 523 FomulaSimplifications, 30 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 42 FomulaSimplificationsInter, 1880 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 6.9s SatisfiabilityAnalysisTime, 40.7s InterpolantComputationTime, 2772 NumberOfCodeBlocks, 2772 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2864 ConstructedInterpolants, 116 QuantifiedInterpolants, 12720 SizeOfPredicates, 96 NumberOfNonLiveVariables, 30620 ConjunctsInSsa, 287 ConjunctsInUnsatCore, 34 InterpolantComputations, 17 PerfectInterpolantSequences, 1524/1691 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: 6806]: Loop Invariant [2023-11-06 22:28:48,073 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20 : int :: old(#memory_$Pointer$.base)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20][8] == 0) could not be translated [2023-11-06 22:28:48,107 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:28:48,108 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5 : int :: 18446744073709551616 * (old(#memory_int)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5][0] / 18446744073709551616) < old(#memory_int)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5][0]) could not be translated [2023-11-06 22:28:48,108 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17 : int, v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15 : int :: !(old(#memory_$Pointer$.base)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17][v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15 + 8] == 0) || !(old(#memory_$Pointer$.offset)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17][v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15 + 8] == 0)) could not be translated [2023-11-06 22:28:48,109 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20 : int :: old(#memory_$Pointer$.base)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_20][8] == 0) could not be translated [2023-11-06 22:28:48,109 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!offset has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:28:48,109 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5 : int :: 18446744073709551616 * (old(#memory_int)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5][0] / 18446744073709551616) < old(#memory_int)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_5][0]) could not be translated [2023-11-06 22:28:48,110 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17 : int, v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15 : int :: !(old(#memory_$Pointer$.base)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17][v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15 + 8] == 0) || !(old(#memory_$Pointer$.offset)[v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base_BEFORE_CALL_17][v_ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset_BEFORE_CALL_15 + 8] == 0)) could not be translated Derived loop invariant: NULL - InvariantResult [Line: 9562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9327]: Loop Invariant [2023-11-06 22:28:48,111 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#cursor~2!base] could not be translated [2023-11-06 22:28:48,111 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#cursor~2!base][8] could not be translated [2023-11-06 22:28:48,111 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base] could not be translated [2023-11-06 22:28:48,112 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base][0] could not be translated [2023-11-06 22:28:48,112 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base] could not be translated [2023-11-06 22:28:48,112 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base][0] could not be translated [2023-11-06 22:28:48,112 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base] could not be translated [2023-11-06 22:28:48,113 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base][0] could not be translated [2023-11-06 22:28:48,113 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base] could not be translated [2023-11-06 22:28:48,113 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base][0] could not be translated [2023-11-06 22:28:48,113 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#cursor~2!base] could not be translated [2023-11-06 22:28:48,113 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#cursor~2!base][8] could not be translated [2023-11-06 22:28:48,114 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#cursor~2!base] could not be translated [2023-11-06 22:28:48,114 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#cursor~2!base][8] could not be translated [2023-11-06 22:28:48,115 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#cursor~2!base] could not be translated [2023-11-06 22:28:48,115 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.offset[~#cursor~2!base][8] could not be translated [2023-11-06 22:28:48,116 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base] could not be translated [2023-11-06 22:28:48,116 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base][0] could not be translated [2023-11-06 22:28:48,116 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base] could not be translated [2023-11-06 22:28:48,116 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base][0] could not be translated [2023-11-06 22:28:48,116 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base] could not be translated [2023-11-06 22:28:48,117 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base][0] could not be translated [2023-11-06 22:28:48,117 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base] could not be translated [2023-11-06 22:28:48,117 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#cursor~2!base][0] could not be translated [2023-11-06 22:28:48,117 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#cursor~2!base] could not be translated [2023-11-06 22:28:48,118 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#cursor~2!base][8] could not be translated [2023-11-06 22:28:48,118 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#cursor~2!base] could not be translated [2023-11-06 22:28:48,118 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$.base[~#cursor~2!base][8] could not be translated Derived loop invariant: (((((((\result == 0) && !((str == 0))) && !((str == 0))) && (2 <= cursor)) || ((2 <= cursor) && (str == 0))) || ((((\result == 0) && !((str == 0))) && !((str == 0))) && (2 <= cursor))) || ((2 <= cursor) && (str == 0))) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:28:48,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_327abdad-31ee-4b45-9c2f-01a523693f1f/bin/uautomizer-verify-WvqO1wxjHP/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