./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_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_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/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_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/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_12a6789f-53b5-408d-b6e7-ffa9dcc48266/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 2e74061603d1466b037b305bab04ccfaa41041189a61fef40533e07a2fdf1d25 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:25:13,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:25:13,447 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-06 22:25:13,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:25:13,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:25:13,479 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:25:13,480 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:25:13,480 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:25:13,481 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:25:13,482 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:25:13,483 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:25:13,483 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:25:13,484 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:25:13,485 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:25:13,485 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:25:13,486 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:25:13,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:25:13,487 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:25:13,487 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:25:13,488 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:25:13,488 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:25:13,489 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:25:13,490 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:25:13,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:25:13,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:25:13,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:25:13,492 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:25:13,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:25:13,493 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:25:13,493 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:25:13,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:25:13,494 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:25:13,494 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:25:13,495 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:25:13,495 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:25:13,495 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:25:13,496 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_12a6789f-53b5-408d-b6e7-ffa9dcc48266/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_12a6789f-53b5-408d-b6e7-ffa9dcc48266/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 -> 2e74061603d1466b037b305bab04ccfaa41041189a61fef40533e07a2fdf1d25 [2023-11-06 22:25:13,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:25:13,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:25:13,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:25:13,829 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:25:13,829 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:25:13,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i [2023-11-06 22:25:17,014 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:25:17,626 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:25:17,626 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i [2023-11-06 22:25:17,683 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/data/686a587f3/b37fcd2b665f44d4a0ab762b936e0a2e/FLAGfdeb8655f [2023-11-06 22:25:17,702 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/data/686a587f3/b37fcd2b665f44d4a0ab762b936e0a2e [2023-11-06 22:25:17,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:25:17,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:25:17,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:25:17,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:25:17,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:25:17,725 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:25:17" (1/1) ... [2023-11-06 22:25:17,726 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76babd9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:17, skipping insertion in model container [2023-11-06 22:25:17,727 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:25:17" (1/1) ... [2023-11-06 22:25:17,873 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:25:18,193 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_12a6789f-53b5-408d-b6e7-ffa9dcc48266/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4503,4516] [2023-11-06 22:25:18,203 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_12a6789f-53b5-408d-b6e7-ffa9dcc48266/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4563,4576] [2023-11-06 22:25:19,354 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:25:19,355 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:25:19,356 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:25:19,357 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:25:19,358 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:25:19,374 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:25:19,375 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:25:19,378 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:25:19,378 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:25:19,897 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-06 22:25:19,899 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-06 22:25:19,900 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-06 22:25:19,914 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-06 22:25:19,916 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-06 22:25:19,917 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-06 22:25:19,918 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-06 22:25:19,919 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-06 22:25:19,919 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-06 22:25:19,920 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-06 22:25:20,262 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:25:20,270 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:25:20,345 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:25:20,406 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:25:20,420 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_12a6789f-53b5-408d-b6e7-ffa9dcc48266/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4503,4516] [2023-11-06 22:25:20,421 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_12a6789f-53b5-408d-b6e7-ffa9dcc48266/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_empty_array_harness.i[4563,4576] [2023-11-06 22:25:20,457 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:25:20,457 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:25:20,458 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:25:20,458 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:25:20,459 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:25:20,466 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:25:20,467 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:25:20,468 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:25:20,468 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:25:20,503 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-06 22:25:20,508 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-06 22:25:20,508 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-06 22:25:20,509 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-06 22:25:20,510 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-06 22:25:20,511 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-06 22:25:20,512 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-06 22:25:20,516 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-06 22:25:20,517 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-06 22:25:20,517 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-06 22:25:20,716 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8269] [2023-11-06 22:25:20,718 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:25:20,719 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:25:20,735 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8755-8766] [2023-11-06 22:25:20,756 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:25:21,007 WARN L672 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:25:21,007 WARN L672 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:25:21,008 WARN L672 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:25:21,008 WARN L672 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:25:21,008 WARN L672 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:25:21,008 WARN L672 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:25:21,008 WARN L672 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:25:21,009 WARN L672 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:25:21,009 WARN L672 CHandler]: The function fprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:25:21,009 WARN L672 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:25:21,009 WARN L672 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:25:21,009 WARN L672 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:25:21,010 WARN L672 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:25:21,010 WARN L672 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:25:21,010 WARN L672 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:25:21,010 WARN L672 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:25:21,011 WARN L672 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:25:21,011 WARN L672 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:25:21,017 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:25:21,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:21 WrapperNode [2023-11-06 22:25:21,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:25:21,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:25:21,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:25:21,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:25:21,029 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:25:21" (1/1) ... [2023-11-06 22:25:21,189 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:25:21" (1/1) ... [2023-11-06 22:25:21,288 INFO L138 Inliner]: procedures = 689, calls = 2617, calls flagged for inlining = 59, calls inlined = 5, statements flattened = 789 [2023-11-06 22:25:21,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:25:21,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:25:21,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:25:21,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:25:21,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:21" (1/1) ... [2023-11-06 22:25:21,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:21" (1/1) ... [2023-11-06 22:25:21,314 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:21" (1/1) ... [2023-11-06 22:25:21,315 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:21" (1/1) ... [2023-11-06 22:25:21,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:21" (1/1) ... [2023-11-06 22:25:21,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:21" (1/1) ... [2023-11-06 22:25:21,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:21" (1/1) ... [2023-11-06 22:25:21,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:21" (1/1) ... [2023-11-06 22:25:21,404 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:25:21,406 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:25:21,406 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:25:21,406 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:25:21,407 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:21" (1/1) ... [2023-11-06 22:25:21,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:25:21,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:25:21,448 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/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:25:21,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/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:25:21,500 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2023-11-06 22:25:21,500 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2023-11-06 22:25:21,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:25:21,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:25:21,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-06 22:25:21,501 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-06 22:25:21,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:25:21,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:25:21,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:25:21,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:25:21,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:25:21,503 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-06 22:25:21,504 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-06 22:25:21,504 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:25:21,504 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:25:21,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:25:21,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 22:25:21,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 22:25:21,505 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-06 22:25:21,505 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-06 22:25:21,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:25:21,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:25:21,795 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:25:21,797 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:25:23,162 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:25:23,167 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:25:23,168 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:25:23,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:25:23 BoogieIcfgContainer [2023-11-06 22:25:23,170 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:25:23,173 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:25:23,173 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:25:23,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:25:23,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:25:17" (1/3) ... [2023-11-06 22:25:23,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee33a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:25:23, skipping insertion in model container [2023-11-06 22:25:23,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:21" (2/3) ... [2023-11-06 22:25:23,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee33a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:25:23, skipping insertion in model container [2023-11-06 22:25:23,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:25:23" (3/3) ... [2023-11-06 22:25:23,180 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_empty_array_harness.i [2023-11-06 22:25:23,201 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:25:23,201 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:25:23,254 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:25:23,261 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;@39d3ec56, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:25:23,261 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:25:23,266 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 22:25:23,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-06 22:25:23,303 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:23,303 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:23,304 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:23,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:23,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1393308319, now seen corresponding path program 1 times [2023-11-06 22:25:23,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:23,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621480351] [2023-11-06 22:25:23,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:23,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:23,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:25:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:24,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:25:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:24,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:25:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:24,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:25:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:24,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:25:24,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:24,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621480351] [2023-11-06 22:25:24,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621480351] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:24,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:24,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:25:24,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315823331] [2023-11-06 22:25:24,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:24,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:25:24,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:24,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:25:24,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:25:24,154 INFO L87 Difference]: Start difference. First operand has 69 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:25:24,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:24,508 INFO L93 Difference]: Finished difference Result 133 states and 180 transitions. [2023-11-06 22:25:24,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:25:24,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2023-11-06 22:25:24,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:24,519 INFO L225 Difference]: With dead ends: 133 [2023-11-06 22:25:24,519 INFO L226 Difference]: Without dead ends: 62 [2023-11-06 22:25:24,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:25:24,533 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 34 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:24,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 70 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:25:24,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-06 22:25:24,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-11-06 22:25:24,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-06 22:25:24,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2023-11-06 22:25:24,593 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 29 [2023-11-06 22:25:24,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:24,596 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2023-11-06 22:25:24,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:25:24,597 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2023-11-06 22:25:24,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-06 22:25:24,600 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:24,600 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:24,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:25:24,602 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:24,603 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:24,607 INFO L85 PathProgramCache]: Analyzing trace with hash 85103393, now seen corresponding path program 1 times [2023-11-06 22:25:24,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:24,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827671119] [2023-11-06 22:25:24,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:24,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:25,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:25:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:25,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:25:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:25,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:25:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:25,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:25:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:25,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:25:25,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:25,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827671119] [2023-11-06 22:25:25,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827671119] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:25,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:25,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:25:25,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442631677] [2023-11-06 22:25:25,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:25,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:25:25,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:25,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:25:25,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:25:25,550 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:25:25,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:25,890 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2023-11-06 22:25:25,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:25:25,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2023-11-06 22:25:25,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:25,894 INFO L225 Difference]: With dead ends: 115 [2023-11-06 22:25:25,894 INFO L226 Difference]: Without dead ends: 65 [2023-11-06 22:25:25,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:25:25,897 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 54 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:25,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 135 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:25:25,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-06 22:25:25,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-11-06 22:25:25,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 46 states have internal predecessors, (52), 14 states have call successors, (14), 5 states have call predecessors, (14), 6 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-06 22:25:25,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2023-11-06 22:25:25,920 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 29 [2023-11-06 22:25:25,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:25,921 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2023-11-06 22:25:25,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:25:25,921 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2023-11-06 22:25:25,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-06 22:25:25,923 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:25,923 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:25,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:25:25,924 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:25,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:25,924 INFO L85 PathProgramCache]: Analyzing trace with hash -682621012, now seen corresponding path program 1 times [2023-11-06 22:25:25,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:25,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855297650] [2023-11-06 22:25:25,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:25,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:26,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:25:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:27,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:25:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:27,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:25:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:27,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:25:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:27,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:25:27,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:27,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855297650] [2023-11-06 22:25:27,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855297650] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:27,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:27,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:25:27,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854254151] [2023-11-06 22:25:27,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:27,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:25:27,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:27,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:25:27,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:25:27,200 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 22:25:27,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:27,707 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2023-11-06 22:25:27,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:25:27,707 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2023-11-06 22:25:27,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:27,709 INFO L225 Difference]: With dead ends: 77 [2023-11-06 22:25:27,709 INFO L226 Difference]: Without dead ends: 75 [2023-11-06 22:25:27,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:25:27,711 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 61 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:27,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 230 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:25:27,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-06 22:25:27,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2023-11-06 22:25:27,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.16) internal successors, (58), 53 states have internal predecessors, (58), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2023-11-06 22:25:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 90 transitions. [2023-11-06 22:25:27,723 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 90 transitions. Word has length 35 [2023-11-06 22:25:27,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:27,724 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 90 transitions. [2023-11-06 22:25:27,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 22:25:27,724 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 90 transitions. [2023-11-06 22:25:27,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-06 22:25:27,726 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:27,726 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:27,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:25:27,727 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:27,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:27,727 INFO L85 PathProgramCache]: Analyzing trace with hash 834697204, now seen corresponding path program 1 times [2023-11-06 22:25:27,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:27,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681356792] [2023-11-06 22:25:27,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:27,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:29,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:25:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:29,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:25:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:29,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:25:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:29,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:25:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:29,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:25:29,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:29,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681356792] [2023-11-06 22:25:29,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681356792] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:29,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:29,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:25:29,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655121712] [2023-11-06 22:25:29,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:29,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:25:29,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:29,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:25:29,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:25:29,413 INFO L87 Difference]: Start difference. First operand 74 states and 90 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:25:29,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:29,985 INFO L93 Difference]: Finished difference Result 143 states and 174 transitions. [2023-11-06 22:25:29,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:25:29,986 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2023-11-06 22:25:29,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:29,987 INFO L225 Difference]: With dead ends: 143 [2023-11-06 22:25:29,988 INFO L226 Difference]: Without dead ends: 86 [2023-11-06 22:25:29,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:25:29,989 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 104 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:29,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 156 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:25:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-06 22:25:30,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2023-11-06 22:25:30,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 57 states have internal predecessors, (63), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2023-11-06 22:25:30,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2023-11-06 22:25:30,008 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 39 [2023-11-06 22:25:30,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:30,009 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2023-11-06 22:25:30,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:25:30,009 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2023-11-06 22:25:30,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-06 22:25:30,012 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:30,013 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:30,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:25:30,013 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:30,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:30,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1092862642, now seen corresponding path program 1 times [2023-11-06 22:25:30,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:30,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391311430] [2023-11-06 22:25:30,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:30,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:35,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:25:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:35,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:25:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:35,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:25:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:35,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:25:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:36,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:25:36,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:36,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391311430] [2023-11-06 22:25:36,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391311430] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:25:36,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132521329] [2023-11-06 22:25:36,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:36,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:36,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:25:36,228 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:25:36,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:25:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:36,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 2405 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-06 22:25:36,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:25:36,954 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2023-11-06 22:25:36,990 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 7 [2023-11-06 22:25:37,007 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2023-11-06 22:25:37,018 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2023-11-06 22:25:37,028 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 61 [2023-11-06 22:25:37,091 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:25:37,092 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 97 [2023-11-06 22:25:37,133 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:25:37,134 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 20 [2023-11-06 22:25:37,186 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 11 [2023-11-06 22:25:39,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:25:39,626 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:25:39,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132521329] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:39,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:25:39,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [17] total 25 [2023-11-06 22:25:39,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844838007] [2023-11-06 22:25:39,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:39,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:25:39,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:39,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:25:39,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2023-11-06 22:25:39,629 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:25:42,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:42,011 INFO L93 Difference]: Finished difference Result 190 states and 233 transitions. [2023-11-06 22:25:42,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:25:42,012 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2023-11-06 22:25:42,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:42,014 INFO L225 Difference]: With dead ends: 190 [2023-11-06 22:25:42,014 INFO L226 Difference]: Without dead ends: 129 [2023-11-06 22:25:42,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2023-11-06 22:25:42,020 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 141 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:42,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 314 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-06 22:25:42,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-06 22:25:42,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 91. [2023-11-06 22:25:42,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 69 states have internal predecessors, (80), 15 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2023-11-06 22:25:42,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2023-11-06 22:25:42,052 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 39 [2023-11-06 22:25:42,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:42,053 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2023-11-06 22:25:42,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:25:42,053 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2023-11-06 22:25:42,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-06 22:25:42,055 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:42,055 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:42,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:25:42,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:42,267 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:42,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:42,267 INFO L85 PathProgramCache]: Analyzing trace with hash -187001036, now seen corresponding path program 1 times [2023-11-06 22:25:42,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:42,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75634986] [2023-11-06 22:25:42,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:42,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:43,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:25:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:43,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:25:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:43,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:25:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:43,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:25:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:25:43,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:43,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75634986] [2023-11-06 22:25:43,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75634986] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:43,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:43,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:25:43,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946966643] [2023-11-06 22:25:43,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:43,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:25:43,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:43,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:25:43,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:25:43,593 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:25:44,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:44,113 INFO L93 Difference]: Finished difference Result 194 states and 240 transitions. [2023-11-06 22:25:44,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:25:44,114 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2023-11-06 22:25:44,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:44,115 INFO L225 Difference]: With dead ends: 194 [2023-11-06 22:25:44,115 INFO L226 Difference]: Without dead ends: 119 [2023-11-06 22:25:44,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:25:44,117 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 131 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:44,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 163 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:25:44,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-06 22:25:44,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 93. [2023-11-06 22:25:44,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 71 states have internal predecessors, (83), 15 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2023-11-06 22:25:44,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2023-11-06 22:25:44,154 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 39 [2023-11-06 22:25:44,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:44,155 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2023-11-06 22:25:44,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:25:44,156 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2023-11-06 22:25:44,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-06 22:25:44,161 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:44,161 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:44,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:25:44,162 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:44,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:44,162 INFO L85 PathProgramCache]: Analyzing trace with hash -495485260, now seen corresponding path program 1 times [2023-11-06 22:25:44,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:44,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062250964] [2023-11-06 22:25:44,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:44,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:44,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:25:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:44,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:25:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:44,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:25:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:44,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:25:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:44,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:25:44,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:44,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062250964] [2023-11-06 22:25:44,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062250964] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:44,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:44,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:25:44,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304047177] [2023-11-06 22:25:44,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:44,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:25:44,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:44,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:25:44,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:25:44,539 INFO L87 Difference]: Start difference. First operand 93 states and 115 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 22:25:44,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:44,850 INFO L93 Difference]: Finished difference Result 183 states and 232 transitions. [2023-11-06 22:25:44,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:25:44,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2023-11-06 22:25:44,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:44,853 INFO L225 Difference]: With dead ends: 183 [2023-11-06 22:25:44,854 INFO L226 Difference]: Without dead ends: 106 [2023-11-06 22:25:44,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:25:44,858 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 62 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:44,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 116 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:25:44,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-06 22:25:44,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 93. [2023-11-06 22:25:44,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 71 states have internal predecessors, (82), 15 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2023-11-06 22:25:44,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2023-11-06 22:25:44,884 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 39 [2023-11-06 22:25:44,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:44,885 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2023-11-06 22:25:44,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 22:25:44,885 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2023-11-06 22:25:44,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-06 22:25:44,887 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:44,887 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:44,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:25:44,888 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:44,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:44,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1775348938, now seen corresponding path program 1 times [2023-11-06 22:25:44,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:44,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753011388] [2023-11-06 22:25:44,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:44,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:25:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:25:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:25:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:25:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:25:45,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:45,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753011388] [2023-11-06 22:25:45,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753011388] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:45,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:45,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:25:45,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282762068] [2023-11-06 22:25:45,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:45,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:25:45,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:45,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:25:45,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:25:45,738 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 22:25:46,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:46,155 INFO L93 Difference]: Finished difference Result 172 states and 213 transitions. [2023-11-06 22:25:46,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:25:46,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2023-11-06 22:25:46,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:46,157 INFO L225 Difference]: With dead ends: 172 [2023-11-06 22:25:46,157 INFO L226 Difference]: Without dead ends: 100 [2023-11-06 22:25:46,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:25:46,158 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 47 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:46,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 135 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:25:46,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-06 22:25:46,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2023-11-06 22:25:46,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 69 states have internal predecessors, (78), 15 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2023-11-06 22:25:46,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2023-11-06 22:25:46,182 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 39 [2023-11-06 22:25:46,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:46,183 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2023-11-06 22:25:46,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 22:25:46,183 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2023-11-06 22:25:46,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-06 22:25:46,184 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:46,185 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:46,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:25:46,185 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:46,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:46,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1543914243, now seen corresponding path program 1 times [2023-11-06 22:25:46,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:46,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203487323] [2023-11-06 22:25:46,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:46,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:47,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:25:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:47,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:25:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:47,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:25:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:47,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:25:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:25:47,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:47,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203487323] [2023-11-06 22:25:47,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203487323] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:47,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:47,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:25:47,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570266057] [2023-11-06 22:25:47,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:47,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:25:47,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:47,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:25:47,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:25:47,254 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 22:25:47,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:47,809 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2023-11-06 22:25:47,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:25:47,809 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2023-11-06 22:25:47,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:47,811 INFO L225 Difference]: With dead ends: 113 [2023-11-06 22:25:47,811 INFO L226 Difference]: Without dead ends: 111 [2023-11-06 22:25:47,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:25:47,812 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 70 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:47,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 292 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:25:47,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-06 22:25:47,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2023-11-06 22:25:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 71 states have internal predecessors, (80), 15 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2023-11-06 22:25:47,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2023-11-06 22:25:47,827 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 112 transitions. Word has length 41 [2023-11-06 22:25:47,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:47,828 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 112 transitions. [2023-11-06 22:25:47,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 22:25:47,828 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2023-11-06 22:25:47,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-06 22:25:47,829 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:47,829 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:47,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:25:47,830 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:47,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:47,830 INFO L85 PathProgramCache]: Analyzing trace with hash -842849665, now seen corresponding path program 1 times [2023-11-06 22:25:47,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:47,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238784763] [2023-11-06 22:25:47,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:47,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:49,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:25:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:49,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:25:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:49,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:25:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:49,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:25:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:49,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:25:49,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:49,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238784763] [2023-11-06 22:25:49,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238784763] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:49,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:49,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:25:49,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564220015] [2023-11-06 22:25:49,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:49,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:25:49,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:49,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:25:49,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:25:49,331 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:25:49,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:49,753 INFO L93 Difference]: Finished difference Result 175 states and 209 transitions. [2023-11-06 22:25:49,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:25:49,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2023-11-06 22:25:49,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:49,755 INFO L225 Difference]: With dead ends: 175 [2023-11-06 22:25:49,755 INFO L226 Difference]: Without dead ends: 103 [2023-11-06 22:25:49,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:25:49,756 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 70 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:49,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 135 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:25:49,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-06 22:25:49,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 86. [2023-11-06 22:25:49,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 65 states have internal predecessors, (75), 14 states have call successors, (14), 7 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-06 22:25:49,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2023-11-06 22:25:49,775 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 41 [2023-11-06 22:25:49,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:49,775 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2023-11-06 22:25:49,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-06 22:25:49,776 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2023-11-06 22:25:49,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-06 22:25:49,777 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:49,777 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:49,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:25:49,777 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:49,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:49,778 INFO L85 PathProgramCache]: Analyzing trace with hash -143563596, now seen corresponding path program 1 times [2023-11-06 22:25:49,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:49,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945419787] [2023-11-06 22:25:49,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:49,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:25:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:25:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:25:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:25:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:25:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:25:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,277 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:25:50,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:50,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945419787] [2023-11-06 22:25:50,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945419787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:50,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:50,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:25:50,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088066164] [2023-11-06 22:25:50,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:50,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:25:50,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:50,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:25:50,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:25:50,281 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:25:50,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:50,590 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2023-11-06 22:25:50,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:25:50,591 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2023-11-06 22:25:50,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:50,592 INFO L225 Difference]: With dead ends: 118 [2023-11-06 22:25:50,592 INFO L226 Difference]: Without dead ends: 86 [2023-11-06 22:25:50,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:25:50,593 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 62 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:50,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 106 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:25:50,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-06 22:25:50,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-11-06 22:25:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 65 states have internal predecessors, (74), 14 states have call successors, (14), 7 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-06 22:25:50,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2023-11-06 22:25:50,608 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 48 [2023-11-06 22:25:50,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:50,609 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2023-11-06 22:25:50,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:25:50,609 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2023-11-06 22:25:50,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-06 22:25:50,610 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:50,610 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:50,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:25:50,611 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:50,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:50,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1027849983, now seen corresponding path program 1 times [2023-11-06 22:25:50,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:50,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076384211] [2023-11-06 22:25:50,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:50,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:51,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:25:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:51,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:25:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:51,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:25:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:51,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:25:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:51,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:25:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:51,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:25:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:51,538 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:25:51,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:51,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076384211] [2023-11-06 22:25:51,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076384211] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:51,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:51,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:25:51,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343634983] [2023-11-06 22:25:51,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:51,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:25:51,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:51,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:25:51,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:25:51,543 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:25:51,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:51,960 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2023-11-06 22:25:51,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:25:51,961 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 54 [2023-11-06 22:25:51,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:51,962 INFO L225 Difference]: With dead ends: 102 [2023-11-06 22:25:51,962 INFO L226 Difference]: Without dead ends: 100 [2023-11-06 22:25:51,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:25:51,963 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 59 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:51,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 230 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:25:51,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-06 22:25:51,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2023-11-06 22:25:51,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 76 states have internal predecessors, (83), 15 states have call successors, (15), 8 states have call predecessors, (15), 11 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2023-11-06 22:25:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 116 transitions. [2023-11-06 22:25:51,979 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 116 transitions. Word has length 54 [2023-11-06 22:25:51,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:51,979 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 116 transitions. [2023-11-06 22:25:51,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:25:51,980 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 116 transitions. [2023-11-06 22:25:51,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-06 22:25:51,981 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:51,981 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:51,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:25:51,982 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:51,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:51,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1925837369, now seen corresponding path program 1 times [2023-11-06 22:25:51,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:51,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241148870] [2023-11-06 22:25:51,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:51,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:53,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:25:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:53,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:25:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:53,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:25:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:53,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:25:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:53,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:25:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:53,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:25:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:25:53,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:53,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241148870] [2023-11-06 22:25:53,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241148870] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:53,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:53,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:25:53,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982801423] [2023-11-06 22:25:53,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:53,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:25:53,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:53,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:25:53,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:25:53,788 INFO L87 Difference]: Start difference. First operand 99 states and 116 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-06 22:25:54,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:54,358 INFO L93 Difference]: Finished difference Result 140 states and 163 transitions. [2023-11-06 22:25:54,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:25:54,358 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 58 [2023-11-06 22:25:54,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:54,360 INFO L225 Difference]: With dead ends: 140 [2023-11-06 22:25:54,360 INFO L226 Difference]: Without dead ends: 106 [2023-11-06 22:25:54,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:25:54,361 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 118 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:54,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 102 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:25:54,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-06 22:25:54,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2023-11-06 22:25:54,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 74 states have (on average 1.135135135135135) internal successors, (84), 78 states have internal predecessors, (84), 15 states have call successors, (15), 8 states have call predecessors, (15), 11 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2023-11-06 22:25:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2023-11-06 22:25:54,376 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 58 [2023-11-06 22:25:54,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:54,377 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2023-11-06 22:25:54,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-06 22:25:54,377 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2023-11-06 22:25:54,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-06 22:25:54,378 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:54,378 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:54,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:25:54,379 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:54,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:54,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1667671931, now seen corresponding path program 1 times [2023-11-06 22:25:54,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:54,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313067522] [2023-11-06 22:25:54,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:54,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:56,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:25:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:56,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:25:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:56,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:25:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:56,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:25:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:56,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:25:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:56,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:25:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:57,232 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 22:25:57,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:57,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313067522] [2023-11-06 22:25:57,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313067522] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:25:57,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368598400] [2023-11-06 22:25:57,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:57,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:25:57,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:25:57,234 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:25:57,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:25:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 2475 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-06 22:25:58,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:25:58,656 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 8 treesize of output 1 [2023-11-06 22:25:58,659 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 8 treesize of output 1 [2023-11-06 22:25:59,655 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:25:59,655 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:26:00,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368598400] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:26:00,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:26:00,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 25 [2023-11-06 22:26:00,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732779130] [2023-11-06 22:26:00,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:26:00,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-06 22:26:00,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:00,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-06 22:26:00,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2023-11-06 22:26:00,336 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand has 25 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 6 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2023-11-06 22:26:03,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:03,625 INFO L93 Difference]: Finished difference Result 256 states and 303 transitions. [2023-11-06 22:26:03,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-06 22:26:03,626 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 6 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) Word has length 58 [2023-11-06 22:26:03,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:03,628 INFO L225 Difference]: With dead ends: 256 [2023-11-06 22:26:03,628 INFO L226 Difference]: Without dead ends: 215 [2023-11-06 22:26:03,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=399, Invalid=2151, Unknown=0, NotChecked=0, Total=2550 [2023-11-06 22:26:03,630 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 307 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 1412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:03,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 255 Invalid, 1412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-06 22:26:03,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-11-06 22:26:03,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 139. [2023-11-06 22:26:03,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 107 states have (on average 1.158878504672897) internal successors, (124), 112 states have internal predecessors, (124), 17 states have call successors, (17), 10 states have call predecessors, (17), 14 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2023-11-06 22:26:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 162 transitions. [2023-11-06 22:26:03,655 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 162 transitions. Word has length 58 [2023-11-06 22:26:03,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:03,655 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 162 transitions. [2023-11-06 22:26:03,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 6 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2023-11-06 22:26:03,656 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 162 transitions. [2023-11-06 22:26:03,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-06 22:26:03,656 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:03,657 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:03,670 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:26:03,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-06 22:26:03,868 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:03,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:03,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1347431687, now seen corresponding path program 1 times [2023-11-06 22:26:03,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:03,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165930783] [2023-11-06 22:26:03,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:03,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:05,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:26:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:05,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:26:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:05,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:26:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:05,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:26:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:05,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:26:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:05,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:26:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:26:05,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:05,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165930783] [2023-11-06 22:26:05,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165930783] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:05,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:05,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:26:05,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475683031] [2023-11-06 22:26:05,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:05,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:26:05,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:05,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:26:05,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:26:05,512 INFO L87 Difference]: Start difference. First operand 139 states and 162 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-06 22:26:06,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:06,110 INFO L93 Difference]: Finished difference Result 206 states and 237 transitions. [2023-11-06 22:26:06,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:26:06,111 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 58 [2023-11-06 22:26:06,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:06,112 INFO L225 Difference]: With dead ends: 206 [2023-11-06 22:26:06,112 INFO L226 Difference]: Without dead ends: 136 [2023-11-06 22:26:06,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:26:06,114 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 146 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:06,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 123 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:26:06,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-06 22:26:06,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2023-11-06 22:26:06,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 97 states have (on average 1.1134020618556701) internal successors, (108), 101 states have internal predecessors, (108), 17 states have call successors, (17), 10 states have call predecessors, (17), 13 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) [2023-11-06 22:26:06,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 145 transitions. [2023-11-06 22:26:06,141 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 145 transitions. Word has length 58 [2023-11-06 22:26:06,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:06,141 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 145 transitions. [2023-11-06 22:26:06,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-06 22:26:06,142 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 145 transitions. [2023-11-06 22:26:06,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-06 22:26:06,143 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:06,143 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:06,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:26:06,144 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:06,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:06,144 INFO L85 PathProgramCache]: Analyzing trace with hash 592257393, now seen corresponding path program 1 times [2023-11-06 22:26:06,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:06,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441141770] [2023-11-06 22:26:06,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:06,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:07,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:26:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:07,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:26:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:07,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:26:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:07,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:26:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:07,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:26:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:07,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:26:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:07,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:26:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-06 22:26:07,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:07,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441141770] [2023-11-06 22:26:07,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441141770] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:07,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:07,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:26:07,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002943778] [2023-11-06 22:26:07,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:07,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:26:07,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:07,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:26:07,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:26:07,371 INFO L87 Difference]: Start difference. First operand 128 states and 145 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-06 22:26:07,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:07,812 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2023-11-06 22:26:07,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:26:07,813 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 60 [2023-11-06 22:26:07,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:07,815 INFO L225 Difference]: With dead ends: 134 [2023-11-06 22:26:07,815 INFO L226 Difference]: Without dead ends: 132 [2023-11-06 22:26:07,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:26:07,816 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 55 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:07,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 134 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:26:07,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-06 22:26:07,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2023-11-06 22:26:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 100 states have (on average 1.11) internal successors, (111), 104 states have internal predecessors, (111), 17 states have call successors, (17), 11 states have call predecessors, (17), 14 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) [2023-11-06 22:26:07,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 148 transitions. [2023-11-06 22:26:07,837 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 148 transitions. Word has length 60 [2023-11-06 22:26:07,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:07,837 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 148 transitions. [2023-11-06 22:26:07,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-06 22:26:07,838 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 148 transitions. [2023-11-06 22:26:07,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-06 22:26:07,839 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:07,839 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:07,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:26:07,839 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:07,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:07,840 INFO L85 PathProgramCache]: Analyzing trace with hash 506399248, now seen corresponding path program 1 times [2023-11-06 22:26:07,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:07,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745174350] [2023-11-06 22:26:07,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:07,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:08,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:26:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:08,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:26:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:08,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:26:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:08,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:26:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:08,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:26:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:08,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:26:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:08,773 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:26:08,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:08,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745174350] [2023-11-06 22:26:08,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745174350] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:08,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:08,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:26:08,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373390287] [2023-11-06 22:26:08,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:08,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:26:08,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:08,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:26:08,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:26:08,776 INFO L87 Difference]: Start difference. First operand 132 states and 148 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:26:09,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:09,243 INFO L93 Difference]: Finished difference Result 152 states and 168 transitions. [2023-11-06 22:26:09,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:26:09,244 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 60 [2023-11-06 22:26:09,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:09,245 INFO L225 Difference]: With dead ends: 152 [2023-11-06 22:26:09,245 INFO L226 Difference]: Without dead ends: 150 [2023-11-06 22:26:09,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:26:09,247 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 68 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:09,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 292 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:26:09,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-11-06 22:26:09,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 140. [2023-11-06 22:26:09,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 107 states have (on average 1.102803738317757) internal successors, (118), 112 states have internal predecessors, (118), 17 states have call successors, (17), 11 states have call predecessors, (17), 15 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2023-11-06 22:26:09,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 156 transitions. [2023-11-06 22:26:09,269 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 156 transitions. Word has length 60 [2023-11-06 22:26:09,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:09,270 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 156 transitions. [2023-11-06 22:26:09,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:26:09,270 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 156 transitions. [2023-11-06 22:26:09,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-06 22:26:09,271 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:09,271 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:09,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:26:09,272 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:09,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:09,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1207463826, now seen corresponding path program 1 times [2023-11-06 22:26:09,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:09,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860068311] [2023-11-06 22:26:09,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:09,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:10,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:26:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:10,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:26:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:10,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:26:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:10,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:26:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:10,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:26:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:10,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:26:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:10,729 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:26:10,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:10,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860068311] [2023-11-06 22:26:10,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860068311] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:10,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:10,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:26:10,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082143838] [2023-11-06 22:26:10,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:10,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:26:10,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:10,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:26:10,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:26:10,732 INFO L87 Difference]: Start difference. First operand 140 states and 156 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-06 22:26:11,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:11,237 INFO L93 Difference]: Finished difference Result 180 states and 199 transitions. [2023-11-06 22:26:11,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:26:11,238 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 60 [2023-11-06 22:26:11,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:11,240 INFO L225 Difference]: With dead ends: 180 [2023-11-06 22:26:11,240 INFO L226 Difference]: Without dead ends: 135 [2023-11-06 22:26:11,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:26:11,241 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 71 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:11,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 123 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:26:11,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-06 22:26:11,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2023-11-06 22:26:11,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 101 states have (on average 1.0792079207920793) internal successors, (109), 105 states have internal predecessors, (109), 17 states have call successors, (17), 11 states have call predecessors, (17), 14 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) [2023-11-06 22:26:11,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2023-11-06 22:26:11,264 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 60 [2023-11-06 22:26:11,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:11,264 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2023-11-06 22:26:11,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-06 22:26:11,265 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2023-11-06 22:26:11,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-06 22:26:11,266 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:11,266 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:11,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:26:11,266 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:11,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:11,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1397895009, now seen corresponding path program 1 times [2023-11-06 22:26:11,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:11,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170917164] [2023-11-06 22:26:11,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:11,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:12,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:26:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:12,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:26:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:12,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:26:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:26:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:26:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:26:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:26:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:26:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,069 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-06 22:26:13,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:13,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170917164] [2023-11-06 22:26:13,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170917164] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:13,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:13,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:26:13,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864630648] [2023-11-06 22:26:13,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:13,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:26:13,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:13,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:26:13,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:26:13,072 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-06 22:26:13,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:13,606 INFO L93 Difference]: Finished difference Result 139 states and 151 transitions. [2023-11-06 22:26:13,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:26:13,606 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 66 [2023-11-06 22:26:13,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:13,607 INFO L225 Difference]: With dead ends: 139 [2023-11-06 22:26:13,608 INFO L226 Difference]: Without dead ends: 137 [2023-11-06 22:26:13,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:26:13,609 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 55 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:13,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 146 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:26:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-06 22:26:13,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2023-11-06 22:26:13,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 104 states have (on average 1.0769230769230769) internal successors, (112), 108 states have internal predecessors, (112), 17 states have call successors, (17), 12 states have call predecessors, (17), 15 states have return successors, (20), 16 states have call predecessors, (20), 16 states have call successors, (20) [2023-11-06 22:26:13,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2023-11-06 22:26:13,635 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 66 [2023-11-06 22:26:13,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:13,635 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2023-11-06 22:26:13,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-06 22:26:13,635 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2023-11-06 22:26:13,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:26:13,636 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:13,637 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:13,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 22:26:13,637 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:13,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:13,638 INFO L85 PathProgramCache]: Analyzing trace with hash 2018654228, now seen corresponding path program 1 times [2023-11-06 22:26:13,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:13,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850618632] [2023-11-06 22:26:13,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:13,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:16,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:26:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:16,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:26:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:16,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:26:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:16,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:26:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:16,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-06 22:26:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:16,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:26:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,140 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 22:26:17,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:17,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850618632] [2023-11-06 22:26:17,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850618632] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:26:17,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343110051] [2023-11-06 22:26:17,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:17,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:17,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:26:17,143 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:26:17,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:26:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 2484 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-06 22:26:17,792 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:26:17,811 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 1 [2023-11-06 22:26:18,569 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:26:18,569 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:26:18,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343110051] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:26:18,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:26:18,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 23 [2023-11-06 22:26:18,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035028606] [2023-11-06 22:26:18,921 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:26:18,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-06 22:26:18,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:18,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-06 22:26:18,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2023-11-06 22:26:18,923 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 23 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 20 states have internal predecessors, (77), 7 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2023-11-06 22:26:21,384 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:26:24,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:26:25,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:25,328 INFO L93 Difference]: Finished difference Result 322 states and 346 transitions. [2023-11-06 22:26:25,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 22:26:25,329 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 20 states have internal predecessors, (77), 7 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Word has length 64 [2023-11-06 22:26:25,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:25,330 INFO L225 Difference]: With dead ends: 322 [2023-11-06 22:26:25,331 INFO L226 Difference]: Without dead ends: 230 [2023-11-06 22:26:25,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 82 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=218, Invalid=1342, Unknown=0, NotChecked=0, Total=1560 [2023-11-06 22:26:25,332 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 224 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 67 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:25,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 231 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1265 Invalid, 2 Unknown, 0 Unchecked, 5.9s Time] [2023-11-06 22:26:25,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-11-06 22:26:25,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 136. [2023-11-06 22:26:25,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 105 states have (on average 1.0571428571428572) internal successors, (111), 107 states have internal predecessors, (111), 16 states have call successors, (16), 13 states have call predecessors, (16), 14 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2023-11-06 22:26:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 143 transitions. [2023-11-06 22:26:25,368 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 143 transitions. Word has length 64 [2023-11-06 22:26:25,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:25,368 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 143 transitions. [2023-11-06 22:26:25,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 20 states have internal predecessors, (77), 7 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2023-11-06 22:26:25,369 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 143 transitions. [2023-11-06 22:26:25,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-06 22:26:25,370 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:25,370 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:25,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:26:25,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:25,580 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:25,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:25,581 INFO L85 PathProgramCache]: Analyzing trace with hash -134753713, now seen corresponding path program 1 times [2023-11-06 22:26:25,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:25,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398490841] [2023-11-06 22:26:25,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:25,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:26,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:26:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:26,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:26:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:26,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:26:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:26,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:26:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:26,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:26:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:26,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:26:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:26,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:26:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:26,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:26:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:26,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:26:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:26,817 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-06 22:26:26,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:26,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398490841] [2023-11-06 22:26:26,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398490841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:26,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:26,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:26:26,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251236426] [2023-11-06 22:26:26,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:26,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:26:26,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:26,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:26:26,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:26:26,820 INFO L87 Difference]: Start difference. First operand 136 states and 143 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-06 22:26:27,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:27,308 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2023-11-06 22:26:27,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:26:27,308 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 72 [2023-11-06 22:26:27,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:27,310 INFO L225 Difference]: With dead ends: 142 [2023-11-06 22:26:27,310 INFO L226 Difference]: Without dead ends: 140 [2023-11-06 22:26:27,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:26:27,311 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 50 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:27,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 140 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:26:27,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-06 22:26:27,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2023-11-06 22:26:27,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 108 states have (on average 1.0555555555555556) internal successors, (114), 110 states have internal predecessors, (114), 16 states have call successors, (16), 14 states have call predecessors, (16), 15 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2023-11-06 22:26:27,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 146 transitions. [2023-11-06 22:26:27,346 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 146 transitions. Word has length 72 [2023-11-06 22:26:27,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:27,346 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 146 transitions. [2023-11-06 22:26:27,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-06 22:26:27,347 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 146 transitions. [2023-11-06 22:26:27,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-06 22:26:27,348 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:27,348 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:27,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 22:26:27,348 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:27,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:27,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1256277667, now seen corresponding path program 1 times [2023-11-06 22:26:27,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:27,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445601854] [2023-11-06 22:26:27,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:27,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:28,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:26:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:28,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:26:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:28,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:26:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:28,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:26:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:28,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:26:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:28,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:26:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:28,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:26:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:28,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:26:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:28,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:26:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:28,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:26:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:28,889 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-06 22:26:28,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:28,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445601854] [2023-11-06 22:26:28,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445601854] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:28,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:28,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:26:28,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933791432] [2023-11-06 22:26:28,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:28,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:26:28,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:28,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:26:28,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:26:28,892 INFO L87 Difference]: Start difference. First operand 140 states and 146 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-06 22:26:29,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:29,366 INFO L93 Difference]: Finished difference Result 146 states and 151 transitions. [2023-11-06 22:26:29,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:26:29,367 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 79 [2023-11-06 22:26:29,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:29,368 INFO L225 Difference]: With dead ends: 146 [2023-11-06 22:26:29,369 INFO L226 Difference]: Without dead ends: 142 [2023-11-06 22:26:29,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:26:29,370 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 42 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:29,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 206 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:26:29,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-06 22:26:29,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2023-11-06 22:26:29,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 110 states have (on average 1.0454545454545454) internal successors, (115), 111 states have internal predecessors, (115), 16 states have call successors, (16), 15 states have call predecessors, (16), 15 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2023-11-06 22:26:29,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 147 transitions. [2023-11-06 22:26:29,405 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 147 transitions. Word has length 79 [2023-11-06 22:26:29,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:29,406 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 147 transitions. [2023-11-06 22:26:29,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-06 22:26:29,406 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 147 transitions. [2023-11-06 22:26:29,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-06 22:26:29,408 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:29,408 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:29,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-06 22:26:29,408 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:29,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:29,409 INFO L85 PathProgramCache]: Analyzing trace with hash 195550462, now seen corresponding path program 1 times [2023-11-06 22:26:29,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:29,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632031058] [2023-11-06 22:26:29,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:29,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:30,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:26:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:30,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:26:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:30,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:26:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:30,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:26:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:31,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-06 22:26:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:31,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:26:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:31,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:26:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:31,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:26:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:31,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:26:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:31,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:26:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:31,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-06 22:26:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:31,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-06 22:26:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:31,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:26:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:31,276 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-11-06 22:26:31,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:31,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632031058] [2023-11-06 22:26:31,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632031058] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:26:31,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667229469] [2023-11-06 22:26:31,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:31,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:31,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:26:31,282 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:26:31,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:26:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:31,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 2576 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-06 22:26:31,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:26:31,924 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 8 treesize of output 1 [2023-11-06 22:26:31,927 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 8 treesize of output 1 [2023-11-06 22:26:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 39 proven. 10 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-06 22:26:33,097 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:26:33,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667229469] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:26:33,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:26:33,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2023-11-06 22:26:33,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238647128] [2023-11-06 22:26:33,405 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:26:33,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-06 22:26:33,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:33,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 22:26:33,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2023-11-06 22:26:33,407 INFO L87 Difference]: Start difference. First operand 142 states and 147 transitions. Second operand has 19 states, 18 states have (on average 4.722222222222222) internal successors, (85), 17 states have internal predecessors, (85), 6 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (23), 5 states have call predecessors, (23), 6 states have call successors, (23) [2023-11-06 22:26:35,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:35,242 INFO L93 Difference]: Finished difference Result 228 states and 233 transitions. [2023-11-06 22:26:35,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:26:35,243 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.722222222222222) internal successors, (85), 17 states have internal predecessors, (85), 6 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (23), 5 states have call predecessors, (23), 6 states have call successors, (23) Word has length 96 [2023-11-06 22:26:35,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:35,244 INFO L225 Difference]: With dead ends: 228 [2023-11-06 22:26:35,244 INFO L226 Difference]: Without dead ends: 109 [2023-11-06 22:26:35,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 166 SyntacticMatches, 11 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=253, Invalid=1079, Unknown=0, NotChecked=0, Total=1332 [2023-11-06 22:26:35,246 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 169 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:35,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 245 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 22:26:35,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-06 22:26:35,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2023-11-06 22:26:35,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-06 22:26:35,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2023-11-06 22:26:35,276 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 96 [2023-11-06 22:26:35,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:35,276 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2023-11-06 22:26:35,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.722222222222222) internal successors, (85), 17 states have internal predecessors, (85), 6 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (23), 5 states have call predecessors, (23), 6 states have call successors, (23) [2023-11-06 22:26:35,277 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2023-11-06 22:26:35,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-06 22:26:35,278 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:35,278 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:35,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:26:35,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-06 22:26:35,488 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:35,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:35,489 INFO L85 PathProgramCache]: Analyzing trace with hash -378951983, now seen corresponding path program 1 times [2023-11-06 22:26:35,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:35,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337707691] [2023-11-06 22:26:35,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:35,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:26:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:26:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:26:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:26:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-06 22:26:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:26:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:26:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:26:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:26:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:26:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-06 22:26:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:26:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:26:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,870 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-11-06 22:26:35,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:35,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337707691] [2023-11-06 22:26:35,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337707691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:35,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:35,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:26:35,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828091611] [2023-11-06 22:26:35,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:35,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:35,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:35,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:35,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:35,876 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 22:26:36,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:36,086 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2023-11-06 22:26:36,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:26:36,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 102 [2023-11-06 22:26:36,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:36,087 INFO L225 Difference]: With dead ends: 156 [2023-11-06 22:26:36,087 INFO L226 Difference]: Without dead ends: 105 [2023-11-06 22:26:36,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:26:36,088 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 42 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:36,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 116 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:26:36,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-06 22:26:36,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-11-06 22:26:36,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.0) internal successors, (78), 78 states have internal predecessors, (78), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-06 22:26:36,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2023-11-06 22:26:36,111 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2023-11-06 22:26:36,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:36,112 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2023-11-06 22:26:36,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 22:26:36,112 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2023-11-06 22:26:36,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-06 22:26:36,114 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:36,114 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:36,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-06 22:26:36,114 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:36,115 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:36,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1936668706, now seen corresponding path program 1 times [2023-11-06 22:26:36,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:36,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686040834] [2023-11-06 22:26:36,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:36,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:39,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:26:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:39,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:26:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:39,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 22:26:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:39,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-06 22:26:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:39,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-06 22:26:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:39,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:26:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:39,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:26:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:39,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:26:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:39,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:26:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:39,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:26:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:39,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:26:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:39,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 22:26:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:39,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:26:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:39,909 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2023-11-06 22:26:39,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:39,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686040834] [2023-11-06 22:26:39,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686040834] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:39,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:39,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-06 22:26:39,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730626303] [2023-11-06 22:26:39,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:39,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:26:39,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:39,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:26:39,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:26:39,915 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2023-11-06 22:26:40,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:40,752 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2023-11-06 22:26:40,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:26:40,753 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 108 [2023-11-06 22:26:40,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:40,754 INFO L225 Difference]: With dead ends: 105 [2023-11-06 22:26:40,754 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:26:40,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2023-11-06 22:26:40,755 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 50 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:40,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 199 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:26:40,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:26:40,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:26:40,756 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:26:40,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:26:40,757 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2023-11-06 22:26:40,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:40,757 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:26:40,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2023-11-06 22:26:40,757 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:26:40,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:26:40,760 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:26:40,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-06 22:26:40,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:26:47,282 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2023-11-06 22:26:47,282 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 6882 6887) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (forall ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3| Int)) (< (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3|) 16))) (+ .cse0 (* (div (+ 18446744073709551615 (* (- 1) .cse0)) 18446744073709551616) 18446744073709551616))) 1))) [2023-11-06 22:26:47,283 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2023-11-06 22:26:47,283 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2023-11-06 22:26:47,283 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (forall ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3| Int)) (< (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3|) 16))) (+ .cse0 (* (div (+ 18446744073709551615 (* (- 1) .cse0)) 18446744073709551616) 18446744073709551616))) 1))) [2023-11-06 22:26:47,283 INFO L899 garLoopResultBuilder]: For program point L7377-3(line 7377) no Hoare annotation was computed. [2023-11-06 22:26:47,283 INFO L899 garLoopResultBuilder]: For program point L7377-1(line 7377) no Hoare annotation was computed. [2023-11-06 22:26:47,283 INFO L899 garLoopResultBuilder]: For program point L7377(lines 7377 7380) no Hoare annotation was computed. [2023-11-06 22:26:47,284 INFO L899 garLoopResultBuilder]: For program point L7377-7(lines 7377 7380) no Hoare annotation was computed. [2023-11-06 22:26:47,284 INFO L899 garLoopResultBuilder]: For program point L7377-6(lines 7377 7378) no Hoare annotation was computed. [2023-11-06 22:26:47,284 INFO L899 garLoopResultBuilder]: For program point L7377-4(lines 7377 7378) no Hoare annotation was computed. [2023-11-06 22:26:47,284 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7375 7381) the Hoare annotation is: true [2023-11-06 22:26:47,284 INFO L899 garLoopResultBuilder]: For program point L7377-11(lines 7377 7380) no Hoare annotation was computed. [2023-11-06 22:26:47,284 INFO L899 garLoopResultBuilder]: For program point L7377-9(lines 7377 7380) no Hoare annotation was computed. [2023-11-06 22:26:47,284 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7375 7381) no Hoare annotation was computed. [2023-11-06 22:26:47,285 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7375 7381) no Hoare annotation was computed. [2023-11-06 22:26:47,285 INFO L899 garLoopResultBuilder]: For program point L7380-2(line 7380) no Hoare annotation was computed. [2023-11-06 22:26:47,285 INFO L899 garLoopResultBuilder]: For program point L7380(line 7380) no Hoare annotation was computed. [2023-11-06 22:26:47,285 INFO L899 garLoopResultBuilder]: For program point L7380-6(line 7380) no Hoare annotation was computed. [2023-11-06 22:26:47,285 INFO L899 garLoopResultBuilder]: For program point L7380-4(line 7380) no Hoare annotation was computed. [2023-11-06 22:26:47,285 INFO L899 garLoopResultBuilder]: For program point L7380-3(line 7380) no Hoare annotation was computed. [2023-11-06 22:26:47,285 INFO L899 garLoopResultBuilder]: For program point L7380-8(line 7380) no Hoare annotation was computed. [2023-11-06 22:26:47,286 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2023-11-06 22:26:47,286 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 210 212) the Hoare annotation is: true [2023-11-06 22:26:47,286 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2023-11-06 22:26:47,286 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2023-11-06 22:26:47,286 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2023-11-06 22:26:47,286 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2023-11-06 22:26:47,287 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 266) the Hoare annotation is: true [2023-11-06 22:26:47,287 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:26:47,287 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2023-11-06 22:26:47,287 INFO L899 garLoopResultBuilder]: For program point L8219-1(line 8219) no Hoare annotation was computed. [2023-11-06 22:26:47,287 INFO L895 garLoopResultBuilder]: At program point L8219(line 8219) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3| Int)) (<= 1 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3|) 16))) (+ .cse0 (* (div (+ 18446744073709551615 (* (- 1) .cse0)) 18446744073709551616) 18446744073709551616))))) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)) [2023-11-06 22:26:47,287 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2023-11-06 22:26:47,288 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: (let ((.cse7 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse5 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse3 (select .cse7 .cse5))) (let ((.cse6 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse2 (= .cse3 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)) (.cse4 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse8 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (let ((.cse0 (= (select .cse4 .cse5) 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 (= .cse3 0)))) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| (select .cse6 16)) (= (select .cse7 .cse8) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= (select .cse6 0) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (or .cse2 (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1220#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1220#1.base| 0))) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= 0 (select .cse4 .cse8)) (or (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1| Int)) (let ((.cse9 (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 24) 0) (= (select .cse9 0) 0) (<= 1 (mod (select .cse9 16) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1| Int)) (let ((.cse10 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|))) (and (= (select .cse10 24) 0) (= (select .cse10 8) 0) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 8) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 0) 0))))) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)) (let ((.cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse11) (and .cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)))) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))))) [2023-11-06 22:26:47,289 INFO L895 garLoopResultBuilder]: At program point aws_byte_buf_from_empty_array_returnLabel#1(lines 8218 8232) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse6 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse7 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse9 (or (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1| Int)) (let ((.cse11 (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 24) 0) (= (select .cse11 0) 0) (<= 1 (mod (select .cse11 16) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1| Int)) (let ((.cse12 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|))) (and (= (select .cse12 24) 0) (= (select .cse12 8) 0) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 8) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 0) 0)))))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0))) (or (and .cse0 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_10| Int)) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_10|) 16))) (and (<= 1 (+ .cse1 (* (div (+ 18446744073709551615 (* (- 1) .cse1)) 18446744073709551616) 18446744073709551616))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| .cse1)))) .cse2 (or (and .cse3 .cse4) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse3)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse5 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) .cse6 .cse7 .cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse9 .cse10) (and .cse0 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) .cse2 .cse5 .cse3 .cse6 .cse7 .cse8 (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8| Int)) (and (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8|) 8) 0) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8|) 8) 0))) .cse9 .cse10 .cse4))) [2023-11-06 22:26:47,289 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:26:47,289 INFO L895 garLoopResultBuilder]: At program point L8230(line 8230) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|))) (let ((.cse1 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse6 (select .cse3 8))) (let ((.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse5 (= .cse6 0)) (.cse2 (select .cse1 16))) (and (= (select .cse0 24) 0) (= (select .cse1 0) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base| 0)) (= .cse2 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) (= (select .cse3 24) 0) (let ((.cse4 (= (select .cse0 8) 0))) (or (and .cse4 .cse5) (and .cse4 (= .cse6 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)))) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (or .cse5 (< 0 (mod .cse2 18446744073709551616))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))))) [2023-11-06 22:26:47,290 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(line 8976) the Hoare annotation is: true [2023-11-06 22:26:47,290 INFO L895 garLoopResultBuilder]: At program point L8963(line 8963) the Hoare annotation is: (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3| Int)) (<= 1 (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_3|) 16))) (+ .cse0 (* (div (+ 18446744073709551615 (* (- 1) .cse0)) 18446744073709551616) 18446744073709551616))))) [2023-11-06 22:26:47,290 INFO L899 garLoopResultBuilder]: For program point L8963-1(line 8963) no Hoare annotation was computed. [2023-11-06 22:26:47,291 INFO L895 garLoopResultBuilder]: At program point L8969(lines 8969 8971) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse6 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse5 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse7 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (let ((.cse4 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse0 (= (select .cse5 .cse4) 0)) (.cse2 (select .cse3 .cse4))) (or (and .cse0 .cse1 (= .cse2 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)) (and .cse0 (= .cse2 0))))) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1219#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| (select .cse6 16)) (= (select .cse3 .cse7) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= (select .cse6 0) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1219#1.base| 0) (= 0 (select .cse5 .cse7)) (or (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1| Int)) (let ((.cse8 (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 24) 0) (= (select .cse8 0) 0) (<= 1 (mod (select .cse8 16) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1| Int)) (let ((.cse9 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|))) (and (= (select .cse9 24) 0) (= (select .cse9 8) 0) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 8) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 0) 0))))) (let ((.cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse10) (and .cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) [2023-11-06 22:26:47,291 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2023-11-06 22:26:47,291 INFO L899 garLoopResultBuilder]: For program point L8969-1(lines 8969 8971) no Hoare annotation was computed. [2023-11-06 22:26:47,291 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: (let ((.cse7 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse5 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse3 (select .cse7 .cse5))) (let ((.cse6 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse2 (= .cse3 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)) (.cse4 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse8 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (let ((.cse0 (= (select .cse4 .cse5) 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 (= .cse3 0)))) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| (select .cse6 16)) (= (select .cse7 .cse8) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= (select .cse6 0) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (or .cse2 (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1220#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1220#1.base| 0))) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= 0 (select .cse4 .cse8)) (or (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1| Int)) (let ((.cse9 (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 24) 0) (= (select .cse9 0) 0) (<= 1 (mod (select .cse9 16) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1| Int)) (let ((.cse10 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|))) (and (= (select .cse10 24) 0) (= (select .cse10 8) 0) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 8) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 0) 0))))) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)) (let ((.cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse11) (and .cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)))) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))))) [2023-11-06 22:26:47,292 INFO L899 garLoopResultBuilder]: For program point L8230-2(line 8230) no Hoare annotation was computed. [2023-11-06 22:26:47,292 INFO L895 garLoopResultBuilder]: At program point L8967(line 8967) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse6 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse5 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse7 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (let ((.cse4 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse0 (= (select .cse5 .cse4) 0)) (.cse2 (select .cse3 .cse4))) (or (and .cse0 .cse1 (= .cse2 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)) (and .cse0 (= .cse2 0))))) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1217#1| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| (select .cse6 16)) (= (select .cse3 .cse7) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= (select .cse6 0) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= 0 (select .cse5 .cse7)) (or (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1| Int)) (let ((.cse8 (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 24) 0) (= (select .cse8 0) 0) (<= 1 (mod (select .cse8 16) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1| Int)) (let ((.cse9 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|))) (and (= (select .cse9 24) 0) (= (select .cse9 8) 0) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 8) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 0) 0))))) (let ((.cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse10) (and .cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) [2023-11-06 22:26:47,292 INFO L895 garLoopResultBuilder]: At program point L8230-1(line 8230) the Hoare annotation is: (let ((.cse15 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|))) (let ((.cse13 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|)) (.cse12 (select .cse15 16)) (.cse14 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base|))) (let ((.cse0 (= (select .cse14 24) 0)) (.cse1 (= (select .cse15 0) 0)) (.cse2 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base| 0))) (.cse3 (= .cse12 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse4 (= (select .cse14 8) 0)) (.cse6 (= (select .cse13 24) 0)) (.cse7 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#t~ret1060#1| 1)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~capacity#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.offset| 0)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0)) (.cse5 (select .cse13 8))) (or (and .cse0 .cse1 .cse2 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) .cse3 .cse4 (= .cse5 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse4 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.base| 0)) .cse6 .cse7 .cse8 .cse9 (< 0 (mod .cse12 18446744073709551616)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_~bytes#1.offset| 0) .cse10 .cse11 (= .cse5 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)))))) [2023-11-06 22:26:47,293 INFO L899 garLoopResultBuilder]: For program point L8967-1(line 8967) no Hoare annotation was computed. [2023-11-06 22:26:47,293 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:26:47,293 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:26:47,293 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2023-11-06 22:26:47,293 INFO L899 garLoopResultBuilder]: For program point L8959(lines 8959 8975) no Hoare annotation was computed. [2023-11-06 22:26:47,293 INFO L899 garLoopResultBuilder]: For program point L8972(lines 8972 8974) no Hoare annotation was computed. [2023-11-06 22:26:47,293 INFO L899 garLoopResultBuilder]: For program point L8972-2(lines 8972 8974) no Hoare annotation was computed. [2023-11-06 22:26:47,294 INFO L895 garLoopResultBuilder]: At program point L8966-1(line 8966) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse6 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse5 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse7 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (let ((.cse4 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse0 (= (select .cse5 .cse4) 0)) (.cse2 (select .cse3 .cse4))) (or (and .cse0 .cse1 (= .cse2 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)) (and .cse0 (= .cse2 0))))) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| (select .cse6 16)) (= (select .cse3 .cse7) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~ret1216#1| 1) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= (select .cse6 0) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= 0 (select .cse5 .cse7)) (or (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1| Int)) (let ((.cse8 (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 24) 0) (= (select .cse8 0) 0) (<= 1 (mod (select .cse8 16) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1| Int)) (let ((.cse9 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|))) (and (= (select .cse9 24) 0) (= (select .cse9 8) 0) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 8) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 0) 0))))) (let ((.cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse10) (and .cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) [2023-11-06 22:26:47,294 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: (let ((.cse7 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse5 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse3 (select .cse7 .cse5))) (let ((.cse6 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse2 (= .cse3 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)) (.cse4 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse8 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (let ((.cse0 (= (select .cse4 .cse5) 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 (= .cse3 0)))) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| (select .cse6 16)) (= (select .cse7 .cse8) 0) (= |ULTIMATE.start_assert_bytes_match_#t~mem594#1| |ULTIMATE.start_assert_bytes_match_#t~mem593#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= (select .cse6 0) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (or .cse2 (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1220#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1220#1.base| 0))) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= 0 (select .cse4 .cse8)) (or (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1| Int)) (let ((.cse9 (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 24) 0) (= (select .cse9 0) 0) (<= 1 (mod (select .cse9 16) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1| Int)) (let ((.cse10 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|))) (and (= (select .cse10 24) 0) (= (select .cse10 8) 0) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 8) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 0) 0))))) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)) (let ((.cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse11) (and .cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)))) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))))) [2023-11-06 22:26:47,295 INFO L899 garLoopResultBuilder]: For program point L8966-2(line 8966) no Hoare annotation was computed. [2023-11-06 22:26:47,295 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: (let ((.cse7 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse5 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse3 (select .cse7 .cse5))) (let ((.cse6 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse2 (= .cse3 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)) (.cse4 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse8 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (let ((.cse0 (= (select .cse4 .cse5) 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 (= .cse3 0)))) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| (select .cse6 16)) (= (select .cse7 .cse8) 0) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= (select .cse6 0) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (or .cse2 (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1220#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1220#1.base| 0))) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= 0 (select .cse4 .cse8)) (or (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1| Int)) (let ((.cse9 (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 24) 0) (= (select .cse9 0) 0) (<= 1 (mod (select .cse9 16) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1| Int)) (let ((.cse10 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|))) (and (= (select .cse10 24) 0) (= (select .cse10 8) 0) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 8) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 0) 0))))) (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)) (let ((.cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse11) (and .cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)))) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))))) [2023-11-06 22:26:47,296 INFO L895 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse6 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse5 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse7 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0))) (and (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0) (let ((.cse4 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse0 (= (select .cse5 .cse4) 0)) (.cse2 (select .cse3 .cse4))) (or (and .cse0 .cse1 (= .cse2 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)) (and .cse0 (= .cse2 0))))) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| (select .cse6 16)) (= (select .cse3 .cse7) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_#t~mem1218#1| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|) (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0)) (= (select .cse6 0) 0) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0) (= 0 (select .cse5 .cse7)) (or (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1| Int)) (let ((.cse8 (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|))) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 24) 0) (= (select .cse8 0) 0) (<= 1 (mod (select .cse8 16) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1| Int)) (let ((.cse9 (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|))) (and (= (select .cse9 24) 0) (= (select .cse9 8) 0) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 8) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1|) 0) 0))))) (let ((.cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0))) (or (and .cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse10) (and .cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)))) (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) [2023-11-06 22:26:47,296 INFO L899 garLoopResultBuilder]: For program point L8968-1(line 8968) no Hoare annotation was computed. [2023-11-06 22:26:47,296 INFO L895 garLoopResultBuilder]: At program point L8966(line 8966) the Hoare annotation is: (let ((.cse19 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|))) (let ((.cse17 (select .cse19 16))) (let ((.cse1 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.base| 0)) (.cse2 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base| 0))) (.cse3 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.capacity| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.len| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~capacity~1#1| .cse17)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base| 0))) (.cse9 (= (select .cse19 0) 0)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.allocator.offset| 0)) (.cse7 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.base|)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.offset| 0)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| 0)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 0))) (or (and (= (select .cse0 8) 0) .cse1 (= (select .cse0 24) 0) .cse2 .cse3 .cse4 .cse5 .cse6 (= (select .cse7 8) 0) (= (select .cse7 24) 0) .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse18 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 24)) (.cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.offset| 0))) (and .cse1 (let ((.cse16 (+ |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~#buf~3#1.offset| 8))) (let ((.cse13 (= (select .cse7 .cse16) 0)) (.cse15 (select .cse0 .cse16))) (or (and .cse13 .cse14 (= .cse15 |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|)) (and .cse13 (= .cse15 0))))) .cse2 .cse3 .cse4 .cse5 (<= .cse17 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse17) 18446744073709551616)))) (= (select .cse0 .cse18) 0) .cse8 .cse9 .cse10 (= 0 (select .cse7 .cse18)) (or (and .cse14 (= |ULTIMATE.start_aws_byte_buf_from_empty_array_#res#1.buffer.base| |ULTIMATE.start_aws_byte_buf_from_empty_array_harness_~array~0#1.base|) .cse6) (and .cse6 .cse12)) .cse11)))))) [2023-11-06 22:26:47,296 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2023-11-06 22:26:47,297 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2023-11-06 22:26:47,297 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2023-11-06 22:26:47,297 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2023-11-06 22:26:47,297 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2023-11-06 22:26:47,297 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 222 224) the Hoare annotation is: true [2023-11-06 22:26:47,297 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2023-11-06 22:26:47,300 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:47,302 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:26:47,325 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.allocator [2023-11-06 22:26:47,327 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.allocator.base has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:47,327 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_10 : int :: 1 <= #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_10][16] + (18446744073709551615 + -1 * #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_10][16]) / 18446744073709551616 * 18446744073709551616 && #res!capacity == #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_10][16]) could not be translated [2023-11-06 22:26:47,328 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #res!capacity [2023-11-06 22:26:47,328 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!capacity has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:47,329 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.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:26:47,329 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.buffer [2023-11-06 22:26:47,329 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.base has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:47,330 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.buffer [2023-11-06 22:26:47,330 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.base has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:47,330 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.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:26:47,330 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #res!len [2023-11-06 22:26:47,330 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!len has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:47,331 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.allocator.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:26:47,331 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~bytes!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:26:47,331 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: (#memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][24] == 0 && #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][0] == 0) && 1 <= #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][16] % 18446744073709551616) could not be translated [2023-11-06 22:26:47,332 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: ((#memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][24] == 0 && #memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0) && #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][0] == 0) could not be translated [2023-11-06 22:26:47,332 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.allocator [2023-11-06 22:26:47,332 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.allocator.base has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:47,332 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #res!capacity [2023-11-06 22:26:47,332 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!capacity has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:47,333 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #res!len [2023-11-06 22:26:47,333 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!len has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:47,333 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.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:26:47,333 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.allocator.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:26:47,334 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][8] == 0 && #memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][8] == 0) could not be translated [2023-11-06 22:26:47,334 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: (#memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][24] == 0 && #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][0] == 0) && 1 <= #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][16] % 18446744073709551616) could not be translated [2023-11-06 22:26:47,334 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: ((#memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][24] == 0 && #memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0) && #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][0] == 0) could not be translated [2023-11-06 22:26:47,334 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.buffer [2023-11-06 22:26:47,334 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.base has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:47,340 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.allocator [2023-11-06 22:26:47,341 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.allocator.base has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:47,341 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_10 : int :: 1 <= #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_10][16] + (18446744073709551615 + -1 * #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_10][16]) / 18446744073709551616 * 18446744073709551616 && #res!capacity == #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_10][16]) could not be translated [2023-11-06 22:26:47,341 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #res!capacity [2023-11-06 22:26:47,342 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!capacity has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:47,342 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.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:26:47,342 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.buffer [2023-11-06 22:26:47,342 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.base has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:47,342 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.buffer [2023-11-06 22:26:47,343 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.base has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:47,343 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.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:26:47,343 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #res!len [2023-11-06 22:26:47,343 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!len has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:47,344 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.allocator.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:26:47,344 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~bytes!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:26:47,352 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: (#memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][24] == 0 && #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][0] == 0) && 1 <= #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][16] % 18446744073709551616) could not be translated [2023-11-06 22:26:47,353 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: ((#memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][24] == 0 && #memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0) && #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][0] == 0) could not be translated [2023-11-06 22:26:47,353 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.allocator [2023-11-06 22:26:47,353 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.allocator.base has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:47,353 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #res!capacity [2023-11-06 22:26:47,354 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!capacity has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:47,354 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #res!len [2023-11-06 22:26:47,354 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!len has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:47,354 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.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:26:47,355 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.allocator.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:26:47,355 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][8] == 0 && #memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][8] == 0) could not be translated [2023-11-06 22:26:47,355 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: (#memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][24] == 0 && #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][0] == 0) && 1 <= #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][16] % 18446744073709551616) could not be translated [2023-11-06 22:26:47,355 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: ((#memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][24] == 0 && #memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0) && #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][0] == 0) could not be translated [2023-11-06 22:26:47,355 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.buffer [2023-11-06 22:26:47,355 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.base has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:47,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:26:47 BoogieIcfgContainer [2023-11-06 22:26:47,356 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:26:47,357 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:26:47,357 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:26:47,357 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:26:47,358 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:25:23" (3/4) ... [2023-11-06 22:26:47,360 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:26:47,364 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2023-11-06 22:26:47,365 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2023-11-06 22:26:47,365 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2023-11-06 22:26:47,365 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:26:47,365 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-06 22:26:47,388 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 115 nodes and edges [2023-11-06 22:26:47,390 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2023-11-06 22:26:47,392 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2023-11-06 22:26:47,393 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-06 22:26:47,395 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-06 22:26:47,397 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:26:47,398 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-06 22:26:47,400 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:26:48,047 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:26:48,048 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:26:48,048 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:26:48,049 INFO L158 Benchmark]: Toolchain (without parser) took 90338.24ms. Allocated memory was 178.3MB in the beginning and 903.9MB in the end (delta: 725.6MB). Free memory was 130.1MB in the beginning and 675.8MB in the end (delta: -545.8MB). Peak memory consumption was 180.3MB. Max. memory is 16.1GB. [2023-11-06 22:26:48,049 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 130.0MB. Free memory was 82.5MB in the beginning and 82.3MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:26:48,050 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3303.67ms. Allocated memory was 178.3MB in the beginning and 249.6MB in the end (delta: 71.3MB). Free memory was 130.1MB in the beginning and 179.8MB in the end (delta: -49.8MB). Peak memory consumption was 76.5MB. Max. memory is 16.1GB. [2023-11-06 22:26:48,050 INFO L158 Benchmark]: Boogie Procedure Inliner took 268.46ms. Allocated memory is still 249.6MB. Free memory was 179.8MB in the beginning and 168.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:26:48,050 INFO L158 Benchmark]: Boogie Preprocessor took 114.88ms. Allocated memory is still 249.6MB. Free memory was 168.3MB in the beginning and 162.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-06 22:26:48,051 INFO L158 Benchmark]: RCFGBuilder took 1764.71ms. Allocated memory is still 249.6MB. Free memory was 162.0MB in the beginning and 93.7MB in the end (delta: 68.3MB). Peak memory consumption was 68.3MB. Max. memory is 16.1GB. [2023-11-06 22:26:48,051 INFO L158 Benchmark]: TraceAbstraction took 84183.29ms. Allocated memory was 249.6MB in the beginning and 903.9MB in the end (delta: 654.3MB). Free memory was 93.7MB in the beginning and 806.9MB in the end (delta: -713.2MB). Peak memory consumption was 451.0MB. Max. memory is 16.1GB. [2023-11-06 22:26:48,051 INFO L158 Benchmark]: Witness Printer took 691.23ms. Allocated memory is still 903.9MB. Free memory was 806.9MB in the beginning and 675.8MB in the end (delta: 131.1MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2023-11-06 22:26:48,053 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.33ms. Allocated memory is still 130.0MB. Free memory was 82.5MB in the beginning and 82.3MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3303.67ms. Allocated memory was 178.3MB in the beginning and 249.6MB in the end (delta: 71.3MB). Free memory was 130.1MB in the beginning and 179.8MB in the end (delta: -49.8MB). Peak memory consumption was 76.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 268.46ms. Allocated memory is still 249.6MB. Free memory was 179.8MB in the beginning and 168.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 114.88ms. Allocated memory is still 249.6MB. Free memory was 168.3MB in the beginning and 162.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1764.71ms. Allocated memory is still 249.6MB. Free memory was 162.0MB in the beginning and 93.7MB in the end (delta: 68.3MB). Peak memory consumption was 68.3MB. Max. memory is 16.1GB. * TraceAbstraction took 84183.29ms. Allocated memory was 249.6MB in the beginning and 903.9MB in the end (delta: 654.3MB). Free memory was 93.7MB in the beginning and 806.9MB in the end (delta: -713.2MB). Peak memory consumption was 451.0MB. Max. memory is 16.1GB. * Witness Printer took 691.23ms. Allocated memory is still 903.9MB. Free memory was 806.9MB in the beginning and 675.8MB in the end (delta: 131.1MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 8269]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8269] - GenericResultAtLocation [Line: 8755]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8755-8766] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.allocator - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.allocator.base 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 (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_10 : int :: 1 <= #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_10][16] + (18446744073709551615 + -1 * #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_10][16]) / 18446744073709551616 * 18446744073709551616 && #res!capacity == #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_10][16]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #res!capacity - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!capacity 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: Expression aws_byte_buf_from_empty_array_#res#1.buffer.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: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.buffer - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.base 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: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.buffer - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.base 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: Expression aws_byte_buf_from_empty_array_#res#1.buffer.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: unknown boogie variable #res!len - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!len 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: Expression aws_byte_buf_from_empty_array_#res#1.allocator.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: Expression ~bytes!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: (#memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][24] == 0 && #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][0] == 0) && 1 <= #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][16] % 18446744073709551616) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: ((#memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][24] == 0 && #memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0) && #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][0] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.allocator - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.allocator.base 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: unknown boogie variable #res!capacity - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!capacity 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: unknown boogie variable #res!len - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!len 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: Expression aws_byte_buf_from_empty_array_#res#1.buffer.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: Expression aws_byte_buf_from_empty_array_#res#1.allocator.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 (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][8] == 0 && #memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][8] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: (#memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][24] == 0 && #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][0] == 0) && 1 <= #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][16] % 18446744073709551616) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: ((#memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][24] == 0 && #memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0) && #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][0] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.buffer - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.base 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: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.allocator - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.allocator.base 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 (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_10 : int :: 1 <= #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_10][16] + (18446744073709551615 + -1 * #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_10][16]) / 18446744073709551616 * 18446744073709551616 && #res!capacity == #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_10][16]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #res!capacity - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!capacity 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: Expression aws_byte_buf_from_empty_array_#res#1.buffer.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: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.buffer - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.base 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: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.buffer - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.base 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: Expression aws_byte_buf_from_empty_array_#res#1.buffer.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: unknown boogie variable #res!len - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!len 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: Expression aws_byte_buf_from_empty_array_#res#1.allocator.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: Expression ~bytes!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: (#memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][24] == 0 && #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][0] == 0) && 1 <= #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][16] % 18446744073709551616) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: ((#memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][24] == 0 && #memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0) && #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][0] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.allocator - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.allocator.base 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: unknown boogie variable #res!capacity - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!capacity 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: unknown boogie variable #res!len - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #res!len 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: Expression aws_byte_buf_from_empty_array_#res#1.buffer.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: Expression aws_byte_buf_from_empty_array_#res#1.allocator.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 (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][8] == 0 && #memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][8] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: (#memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][24] == 0 && #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][0] == 0) && 1 <= #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][16] % 18446744073709551616) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: ((#memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][24] == 0 && #memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0) && #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][0] == 0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.buffer - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.base has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator * 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 6 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 84.1s, OverallIterations: 25, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 24.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 2378 SdHoareTripleChecker+Valid, 18.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2292 mSDsluCounter, 4394 SdHoareTripleChecker+Invalid, 17.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3429 mSDsCounter, 600 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10775 IncrementalHoareTripleChecker+Invalid, 11377 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 600 mSolverCounterUnsat, 965 mSDtfsCounter, 10775 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1064 GetRequests, 666 SyntacticMatches, 19 SemanticMatches, 379 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1580 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=22, InterpolantAutomatonStates: 261, 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, 25 MinimizatonAttempts, 330 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 184 PreInvPairs, 208 NumberOfFragments, 2358 HoareAnnotationTreeSize, 184 FomulaSimplifications, 2839 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 26876 FormulaSimplificationTreeSizeReductionInter, 5.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 7.2s SatisfiabilityAnalysisTime, 42.5s InterpolantComputationTime, 1670 NumberOfCodeBlocks, 1670 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1641 ConstructedInterpolants, 96 QuantifiedInterpolants, 11156 SizeOfPredicates, 51 NumberOfNonLiveVariables, 9940 ConjunctsInSsa, 155 ConjunctsInUnsatCore, 29 InterpolantComputations, 22 PerfectInterpolantSequences, 711/770 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: 8976]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8218]: Loop Invariant [2023-11-06 22:26:48,070 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.allocator [2023-11-06 22:26:48,071 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.allocator.base has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:48,071 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_10 : int :: 1 <= #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_10][16] + (18446744073709551615 + -1 * #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_10][16]) / 18446744073709551616 * 18446744073709551616 && #res!capacity == #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_10][16]) could not be translated [2023-11-06 22:26:48,071 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #res!capacity [2023-11-06 22:26:48,071 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!capacity has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:48,072 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.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:26:48,072 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.buffer [2023-11-06 22:26:48,072 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.base has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:48,072 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.buffer [2023-11-06 22:26:48,072 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.base has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:48,073 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.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:26:48,073 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #res!len [2023-11-06 22:26:48,073 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!len has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:48,073 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.allocator.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:26:48,073 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~bytes!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:26:48,074 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: (#memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][24] == 0 && #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][0] == 0) && 1 <= #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][16] % 18446744073709551616) could not be translated [2023-11-06 22:26:48,074 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: ((#memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][24] == 0 && #memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0) && #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][0] == 0) could not be translated [2023-11-06 22:26:48,074 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.allocator [2023-11-06 22:26:48,074 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.allocator.base has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:48,074 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #res!capacity [2023-11-06 22:26:48,075 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!capacity has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:48,075 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #res!len [2023-11-06 22:26:48,075 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!len has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:48,075 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.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:26:48,075 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.allocator.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:26:48,076 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][8] == 0 && #memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][8] == 0) could not be translated [2023-11-06 22:26:48,076 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: (#memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][24] == 0 && #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][0] == 0) && 1 <= #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][16] % 18446744073709551616) could not be translated [2023-11-06 22:26:48,076 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: ((#memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][24] == 0 && #memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0) && #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][0] == 0) could not be translated [2023-11-06 22:26:48,076 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.buffer [2023-11-06 22:26:48,076 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.base has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:48,077 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.allocator [2023-11-06 22:26:48,078 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.allocator.base has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:48,078 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_10 : int :: 1 <= #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_10][16] + (18446744073709551615 + -1 * #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_10][16]) / 18446744073709551616 * 18446744073709551616 && #res!capacity == #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_10][16]) could not be translated [2023-11-06 22:26:48,078 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #res!capacity [2023-11-06 22:26:48,078 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!capacity has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:48,079 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.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:26:48,079 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.buffer [2023-11-06 22:26:48,079 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.base has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:48,079 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.buffer [2023-11-06 22:26:48,079 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.base has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:48,079 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.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:26:48,080 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #res!len [2023-11-06 22:26:48,080 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!len has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:48,080 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.allocator.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:26:48,080 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~bytes!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-11-06 22:26:48,081 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: (#memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][24] == 0 && #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][0] == 0) && 1 <= #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][16] % 18446744073709551616) could not be translated [2023-11-06 22:26:48,081 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: ((#memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][24] == 0 && #memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0) && #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][0] == 0) could not be translated [2023-11-06 22:26:48,081 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.allocator [2023-11-06 22:26:48,081 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.allocator.base has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:48,081 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #res!capacity [2023-11-06 22:26:48,081 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!capacity has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:48,082 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #res!len [2023-11-06 22:26:48,082 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression #res!len has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator [2023-11-06 22:26:48,082 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.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:26:48,082 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.allocator.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:26:48,083 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8 : int :: #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][8] == 0 && #memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_8][8] == 0) could not be translated [2023-11-06 22:26:48,083 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: (#memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][24] == 0 && #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][0] == 0) && 1 <= #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][16] % 18446744073709551616) could not be translated [2023-11-06 22:26:48,083 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1 : int :: ((#memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][24] == 0 && #memory_$Pointer$.offset[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0) && #memory_$Pointer$.base[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][8] == 0) && #memory_int[v_ULTIMATE.start_aws_byte_buf_from_empty_array_~#buf~2#1.base_BEFORE_CALL_1][0] == 0) could not be translated [2023-11-06 22:26:48,083 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable aws_byte_buf_from_empty_array_#res#1.buffer [2023-11-06 22:26:48,083 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: Expression aws_byte_buf_from_empty_array_#res#1.buffer.base has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionDeclarator Derived loop invariant: (((((bytes == array) && !((bytes == 0))) && !((buf == 0))) && (capacity == capacity)) || ((!((array == 0)) && !((buf == 0))) && (capacity == capacity))) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:26:48,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12a6789f-53b5-408d-b6e7-ffa9dcc48266/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE