./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 5bb1e95e9d6379d31cbb3e207d6fe85ddf495edebf9b764e927537f63dbf829e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:42:23,524 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:42:23,590 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-29 05:42:23,594 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:42:23,595 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:42:23,616 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:42:23,617 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:42:23,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:42:23,618 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:42:23,619 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:42:23,619 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:42:23,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:42:23,621 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:42:23,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:42:23,622 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:42:23,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:42:23,623 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:42:23,623 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:42:23,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:42:23,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:42:23,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:42:23,625 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:42:23,626 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:42:23,626 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:42:23,627 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:42:23,627 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:42:23,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:42:23,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:42:23,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:42:23,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:42:23,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:42:23,630 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:42:23,630 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:42:23,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:42:23,630 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:42:23,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:42:23,631 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:42:23,631 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:42:23,631 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:42:23,631 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_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/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_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 5bb1e95e9d6379d31cbb3e207d6fe85ddf495edebf9b764e927537f63dbf829e [2023-11-29 05:42:23,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:42:23,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:42:23,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:42:23,870 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:42:23,870 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:42:23,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i [2023-11-29 05:42:26,589 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:42:26,965 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:42:26,966 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i [2023-11-29 05:42:27,000 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/data/aea8a409f/1a5f53d480b54294b03130ecaa7ccc02/FLAGef8cb03f4 [2023-11-29 05:42:27,015 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/data/aea8a409f/1a5f53d480b54294b03130ecaa7ccc02 [2023-11-29 05:42:27,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:42:27,019 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:42:27,020 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:42:27,020 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:42:27,025 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:42:27,026 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:42:27" (1/1) ... [2023-11-29 05:42:27,027 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e1d3eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:27, skipping insertion in model container [2023-11-29 05:42:27,027 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:42:27" (1/1) ... [2023-11-29 05:42:27,141 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:42:27,385 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_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i[4494,4507] [2023-11-29 05:42:27,393 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_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i[4554,4567] [2023-11-29 05:42:28,109 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:42:28,110 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:42:28,110 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:42:28,111 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:42:28,112 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:42:28,149 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:42:28,150 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:42:28,151 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:42:28,152 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:42:28,154 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:42:28,155 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:42:28,156 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:42:28,156 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:42:28,512 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-29 05:42:28,513 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-29 05:42:28,514 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-29 05:42:28,515 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-29 05:42:28,517 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-29 05:42:28,517 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-29 05:42:28,518 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-29 05:42:28,519 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-29 05:42:28,520 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-29 05:42:28,520 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-29 05:42:28,669 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:42:28,685 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:42:28,698 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_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i[4494,4507] [2023-11-29 05:42:28,698 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_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i[4554,4567] [2023-11-29 05:42:28,740 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:42:28,740 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:42:28,740 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:42:28,741 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:42:28,742 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:42:28,753 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:42:28,754 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:42:28,755 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:42:28,756 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:42:28,757 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:42:28,757 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:42:28,758 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:42:28,758 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:42:28,792 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-29 05:42:28,794 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-29 05:42:28,794 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-29 05:42:28,795 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-29 05:42:28,796 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-29 05:42:28,797 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-29 05:42:28,797 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-29 05:42:28,798 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-29 05:42:28,798 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-29 05:42:28,799 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-29 05:42:28,835 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:42:29,070 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:42:29,070 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:42:29,070 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:42:29,070 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:42:29,070 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:42:29,070 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:42:29,071 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:42:29,071 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:42:29,071 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:42:29,071 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:42:29,071 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:42:29,072 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:42:29,072 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:42:29,072 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:42:29,072 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:42:29,079 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:42:29,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:29 WrapperNode [2023-11-29 05:42:29,080 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:42:29,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:42:29,081 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:42:29,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:42:29,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:29" (1/1) ... [2023-11-29 05:42:29,150 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:29" (1/1) ... [2023-11-29 05:42:29,186 INFO L138 Inliner]: procedures = 678, calls = 1039, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 56 [2023-11-29 05:42:29,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:42:29,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:42:29,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:42:29,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:42:29,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:29" (1/1) ... [2023-11-29 05:42:29,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:29" (1/1) ... [2023-11-29 05:42:29,203 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:29" (1/1) ... [2023-11-29 05:42:29,222 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 5, 4, 6]. 35 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0]. The 2 writes are split as follows [0, 0, 1, 1]. [2023-11-29 05:42:29,222 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:29" (1/1) ... [2023-11-29 05:42:29,222 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:29" (1/1) ... [2023-11-29 05:42:29,234 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:29" (1/1) ... [2023-11-29 05:42:29,236 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:29" (1/1) ... [2023-11-29 05:42:29,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:29" (1/1) ... [2023-11-29 05:42:29,243 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:29" (1/1) ... [2023-11-29 05:42:29,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:42:29,249 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:42:29,250 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:42:29,250 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:42:29,251 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:29" (1/1) ... [2023-11-29 05:42:29,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:42:29,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:42:29,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:42:29,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:42:29,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:42:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 05:42:29,315 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 05:42:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-29 05:42:29,315 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-29 05:42:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:42:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 05:42:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 05:42:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 05:42:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 05:42:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:42:29,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:42:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 05:42:29,317 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 05:42:29,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:42:29,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 05:42:29,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 05:42:29,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 05:42:29,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 05:42:29,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 05:42:29,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 05:42:29,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 05:42:29,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-29 05:42:29,318 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-29 05:42:29,318 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-29 05:42:29,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:42:29,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:42:29,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 05:42:29,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 05:42:29,524 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:42:29,527 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:42:29,673 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:42:29,705 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:42:29,705 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 05:42:29,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:42:29 BoogieIcfgContainer [2023-11-29 05:42:29,706 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:42:29,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:42:29,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:42:29,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:42:29,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:42:27" (1/3) ... [2023-11-29 05:42:29,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@140049f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:42:29, skipping insertion in model container [2023-11-29 05:42:29,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:42:29" (2/3) ... [2023-11-29 05:42:29,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@140049f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:42:29, skipping insertion in model container [2023-11-29 05:42:29,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:42:29" (3/3) ... [2023-11-29 05:42:29,714 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_next_harness.i [2023-11-29 05:42:29,729 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:42:29,729 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:42:29,773 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:42:29,778 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=LoopHeads, 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;@63aa346f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:42:29,779 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:42:29,783 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 05:42:29,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 05:42:29,791 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:42:29,792 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:42:29,792 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:42:29,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:42:29,798 INFO L85 PathProgramCache]: Analyzing trace with hash -178940107, now seen corresponding path program 1 times [2023-11-29 05:42:29,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:42:29,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174589832] [2023-11-29 05:42:29,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:29,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:42:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:30,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:42:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:30,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:42:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:30,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:42:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:30,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 05:42:30,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:42:30,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174589832] [2023-11-29 05:42:30,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174589832] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:42:30,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:42:30,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:42:30,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877924135] [2023-11-29 05:42:30,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:42:30,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:42:30,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:42:30,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:42:30,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:42:30,227 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:42:30,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:42:30,268 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2023-11-29 05:42:30,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:42:30,270 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2023-11-29 05:42:30,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:42:30,278 INFO L225 Difference]: With dead ends: 81 [2023-11-29 05:42:30,279 INFO L226 Difference]: Without dead ends: 41 [2023-11-29 05:42:30,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:42:30,285 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:42:30,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:42:30,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-29 05:42:30,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-29 05:42:30,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 05:42:30,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2023-11-29 05:42:30,327 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 25 [2023-11-29 05:42:30,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:42:30,329 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2023-11-29 05:42:30,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:42:30,329 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2023-11-29 05:42:30,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 05:42:30,331 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:42:30,331 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:42:30,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:42:30,331 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:42:30,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:42:30,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1458803785, now seen corresponding path program 1 times [2023-11-29 05:42:30,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:42:30,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75771194] [2023-11-29 05:42:30,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:30,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:42:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:31,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:42:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:31,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:42:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:31,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:42:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:31,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:42:31,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:42:31,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75771194] [2023-11-29 05:42:31,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75771194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:42:31,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:42:31,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:42:31,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312633982] [2023-11-29 05:42:31,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:42:31,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:42:31,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:42:31,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:42:31,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:42:31,325 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 05:42:31,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:42:31,613 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2023-11-29 05:42:31,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:42:31,614 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-11-29 05:42:31,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:42:31,616 INFO L225 Difference]: With dead ends: 51 [2023-11-29 05:42:31,616 INFO L226 Difference]: Without dead ends: 49 [2023-11-29 05:42:31,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:42:31,618 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 13 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:42:31,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 245 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:42:31,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-29 05:42:31,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2023-11-29 05:42:31,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-29 05:42:31,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2023-11-29 05:42:31,632 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 25 [2023-11-29 05:42:31,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:42:31,632 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2023-11-29 05:42:31,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 05:42:31,632 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2023-11-29 05:42:31,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 05:42:31,633 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:42:31,633 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:42:31,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:42:31,634 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:42:31,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:42:31,634 INFO L85 PathProgramCache]: Analyzing trace with hash 316203577, now seen corresponding path program 1 times [2023-11-29 05:42:31,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:42:31,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182398629] [2023-11-29 05:42:31,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:31,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:42:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:31,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:42:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:31,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:42:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:31,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:42:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:31,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:42:31,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:42:31,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182398629] [2023-11-29 05:42:31,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182398629] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:42:31,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:42:31,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:42:31,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4959239] [2023-11-29 05:42:31,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:42:31,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:42:31,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:42:31,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:42:31,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:42:31,990 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 05:42:32,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:42:32,209 INFO L93 Difference]: Finished difference Result 99 states and 126 transitions. [2023-11-29 05:42:32,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:42:32,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-11-29 05:42:32,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:42:32,212 INFO L225 Difference]: With dead ends: 99 [2023-11-29 05:42:32,212 INFO L226 Difference]: Without dead ends: 53 [2023-11-29 05:42:32,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:42:32,214 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:42:32,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 146 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:42:32,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-29 05:42:32,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2023-11-29 05:42:32,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 34 states have internal predecessors, (37), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2023-11-29 05:42:32,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2023-11-29 05:42:32,228 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 25 [2023-11-29 05:42:32,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:42:32,229 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2023-11-29 05:42:32,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 05:42:32,229 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2023-11-29 05:42:32,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 05:42:32,230 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:42:32,230 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] [2023-11-29 05:42:32,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:42:32,231 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:42:32,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:42:32,231 INFO L85 PathProgramCache]: Analyzing trace with hash 996261947, now seen corresponding path program 1 times [2023-11-29 05:42:32,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:42:32,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286596515] [2023-11-29 05:42:32,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:32,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:42:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:32,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:42:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:32,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:42:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:32,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:42:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:32,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:42:32,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:42:32,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286596515] [2023-11-29 05:42:32,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286596515] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:42:32,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270462491] [2023-11-29 05:42:32,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:32,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:42:32,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:42:32,725 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:42:32,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:42:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:32,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 05:42:32,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:42:32,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:42:32,996 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:42:32,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270462491] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:42:32,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:42:32,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-11-29 05:42:32,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115901457] [2023-11-29 05:42:32,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:42:32,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:42:32,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:42:32,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:42:32,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:42:32,998 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 05:42:33,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:42:33,049 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2023-11-29 05:42:33,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:42:33,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-11-29 05:42:33,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:42:33,052 INFO L225 Difference]: With dead ends: 103 [2023-11-29 05:42:33,052 INFO L226 Difference]: Without dead ends: 53 [2023-11-29 05:42:33,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:42:33,054 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:42:33,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 125 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:42:33,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-29 05:42:33,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2023-11-29 05:42:33,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2023-11-29 05:42:33,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2023-11-29 05:42:33,063 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 25 [2023-11-29 05:42:33,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:42:33,064 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2023-11-29 05:42:33,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 05:42:33,064 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2023-11-29 05:42:33,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 05:42:33,065 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:42:33,065 INFO L195 NwaCegarLoop]: trace histogram [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-29 05:42:33,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:42:33,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:42:33,271 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:42:33,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:42:33,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1070928168, now seen corresponding path program 1 times [2023-11-29 05:42:33,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:42:33,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429256768] [2023-11-29 05:42:33,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:33,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:42:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:33,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:42:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:33,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:42:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:33,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:42:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:33,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 05:42:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:33,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:42:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:34,050 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 05:42:34,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:42:34,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429256768] [2023-11-29 05:42:34,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429256768] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:42:34,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:42:34,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 05:42:34,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049577113] [2023-11-29 05:42:34,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:42:34,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:42:34,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:42:34,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:42:34,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:42:34,052 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-29 05:42:34,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:42:34,335 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2023-11-29 05:42:34,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:42:34,335 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2023-11-29 05:42:34,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:42:34,337 INFO L225 Difference]: With dead ends: 59 [2023-11-29 05:42:34,337 INFO L226 Difference]: Without dead ends: 57 [2023-11-29 05:42:34,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-11-29 05:42:34,338 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:42:34,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 324 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:42:34,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-29 05:42:34,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2023-11-29 05:42:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-29 05:42:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2023-11-29 05:42:34,349 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 38 [2023-11-29 05:42:34,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:42:34,349 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2023-11-29 05:42:34,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-29 05:42:34,350 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2023-11-29 05:42:34,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 05:42:34,351 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:42:34,351 INFO L195 NwaCegarLoop]: trace histogram [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-29 05:42:34,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:42:34,351 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:42:34,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:42:34,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1449031766, now seen corresponding path program 1 times [2023-11-29 05:42:34,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:42:34,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144436774] [2023-11-29 05:42:34,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:34,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:42:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:34,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:42:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:34,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:42:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:34,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:42:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:34,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 05:42:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:34,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:42:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:42:34,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:42:34,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144436774] [2023-11-29 05:42:34,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144436774] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:42:34,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671770899] [2023-11-29 05:42:34,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:34,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:42:34,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:42:34,851 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:42:34,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:42:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:34,996 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-29 05:42:35,006 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:42:35,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:42:35,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 05:42:35,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 05:42:35,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 05:42:35,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-11-29 05:42:35,822 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:42:35,822 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:42:35,968 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 05:42:35,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671770899] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 05:42:35,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:42:35,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 20 [2023-11-29 05:42:35,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281880950] [2023-11-29 05:42:35,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:42:35,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:42:35,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:42:35,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:42:35,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2023-11-29 05:42:35,970 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:42:36,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:42:36,169 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2023-11-29 05:42:36,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:42:36,169 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2023-11-29 05:42:36,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:42:36,171 INFO L225 Difference]: With dead ends: 96 [2023-11-29 05:42:36,171 INFO L226 Difference]: Without dead ends: 61 [2023-11-29 05:42:36,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2023-11-29 05:42:36,173 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 15 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:42:36,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 162 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:42:36,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-29 05:42:36,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2023-11-29 05:42:36,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 41 states have internal predecessors, (44), 13 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2023-11-29 05:42:36,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2023-11-29 05:42:36,183 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 38 [2023-11-29 05:42:36,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:42:36,184 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2023-11-29 05:42:36,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:42:36,184 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2023-11-29 05:42:36,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 05:42:36,185 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:42:36,185 INFO L195 NwaCegarLoop]: trace histogram [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-29 05:42:36,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:42:36,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:42:36,391 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:42:36,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:42:36,391 INFO L85 PathProgramCache]: Analyzing trace with hash -768973396, now seen corresponding path program 1 times [2023-11-29 05:42:36,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:42:36,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881025862] [2023-11-29 05:42:36,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:36,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:42:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:36,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:42:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:36,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:42:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:36,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:42:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:36,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 05:42:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:36,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:42:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:36,598 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 05:42:36,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:42:36,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881025862] [2023-11-29 05:42:36,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881025862] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:42:36,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:42:36,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:42:36,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894296291] [2023-11-29 05:42:36,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:42:36,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:42:36,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:42:36,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:42:36,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:42:36,600 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:42:36,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:42:36,681 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2023-11-29 05:42:36,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:42:36,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2023-11-29 05:42:36,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:42:36,683 INFO L225 Difference]: With dead ends: 105 [2023-11-29 05:42:36,683 INFO L226 Difference]: Without dead ends: 61 [2023-11-29 05:42:36,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:42:36,684 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 5 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:42:36,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 197 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:42:36,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-29 05:42:36,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2023-11-29 05:42:36,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 12 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 05:42:36,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2023-11-29 05:42:36,693 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 38 [2023-11-29 05:42:36,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:42:36,694 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2023-11-29 05:42:36,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:42:36,694 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2023-11-29 05:42:36,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 05:42:36,695 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:42:36,695 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:42:36,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:42:36,696 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:42:36,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:42:36,696 INFO L85 PathProgramCache]: Analyzing trace with hash 512667469, now seen corresponding path program 1 times [2023-11-29 05:42:36,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:42:36,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451919161] [2023-11-29 05:42:36,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:36,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:42:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:36,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:42:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:36,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:42:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:36,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:42:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:36,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 05:42:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:36,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:42:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:36,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:42:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:36,931 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 05:42:36,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:42:36,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451919161] [2023-11-29 05:42:36,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451919161] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:42:36,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:42:36,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:42:36,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034320363] [2023-11-29 05:42:36,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:42:36,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:42:36,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:42:36,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:42:36,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:42:36,933 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 05:42:37,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:42:37,035 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2023-11-29 05:42:37,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:42:37,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2023-11-29 05:42:37,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:42:37,036 INFO L225 Difference]: With dead ends: 63 [2023-11-29 05:42:37,036 INFO L226 Difference]: Without dead ends: 61 [2023-11-29 05:42:37,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:42:37,037 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:42:37,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 204 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:42:37,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-29 05:42:37,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-11-29 05:42:37,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 42 states have internal predecessors, (46), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 05:42:37,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2023-11-29 05:42:37,046 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 44 [2023-11-29 05:42:37,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:42:37,047 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2023-11-29 05:42:37,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 05:42:37,047 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2023-11-29 05:42:37,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-29 05:42:37,048 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:42:37,048 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:42:37,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:42:37,049 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:42:37,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:42:37,049 INFO L85 PathProgramCache]: Analyzing trace with hash 630580646, now seen corresponding path program 1 times [2023-11-29 05:42:37,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:42:37,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42360047] [2023-11-29 05:42:37,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:37,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:42:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:37,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:42:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:37,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:42:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:37,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:42:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:37,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 05:42:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:37,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:42:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:37,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:42:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:37,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:42:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:37,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:42:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:37,912 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-29 05:42:37,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:42:37,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42360047] [2023-11-29 05:42:37,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42360047] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:42:37,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:42:37,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:42:37,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152000284] [2023-11-29 05:42:37,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:42:37,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:42:37,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:42:37,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:42:37,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:42:37,915 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 9 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 05:42:38,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:42:38,160 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2023-11-29 05:42:38,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:42:38,161 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2023-11-29 05:42:38,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:42:38,162 INFO L225 Difference]: With dead ends: 71 [2023-11-29 05:42:38,162 INFO L226 Difference]: Without dead ends: 69 [2023-11-29 05:42:38,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:42:38,163 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 13 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:42:38,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 239 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:42:38,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-29 05:42:38,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2023-11-29 05:42:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 47 states have internal predecessors, (50), 13 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-29 05:42:38,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2023-11-29 05:42:38,174 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 57 [2023-11-29 05:42:38,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:42:38,174 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2023-11-29 05:42:38,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 05:42:38,174 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2023-11-29 05:42:38,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-29 05:42:38,175 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:42:38,175 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:42:38,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:42:38,176 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:42:38,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:42:38,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1889379288, now seen corresponding path program 1 times [2023-11-29 05:42:38,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:42:38,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33968470] [2023-11-29 05:42:38,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:38,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:42:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:38,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:42:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:38,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:42:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:38,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:42:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:38,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 05:42:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:38,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:42:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:38,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:42:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:38,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:42:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:38,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:42:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:38,549 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-29 05:42:38,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:42:38,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33968470] [2023-11-29 05:42:38,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33968470] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:42:38,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:42:38,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:42:38,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501600192] [2023-11-29 05:42:38,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:42:38,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:42:38,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:42:38,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:42:38,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:42:38,552 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 05:42:38,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:42:38,741 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2023-11-29 05:42:38,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:42:38,741 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2023-11-29 05:42:38,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:42:38,743 INFO L225 Difference]: With dead ends: 92 [2023-11-29 05:42:38,743 INFO L226 Difference]: Without dead ends: 68 [2023-11-29 05:42:38,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:42:38,744 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:42:38,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 140 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:42:38,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-29 05:42:38,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-29 05:42:38,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 47 states have internal predecessors, (49), 13 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-29 05:42:38,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2023-11-29 05:42:38,756 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 57 [2023-11-29 05:42:38,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:42:38,757 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2023-11-29 05:42:38,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 05:42:38,757 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2023-11-29 05:42:38,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-29 05:42:38,758 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:42:38,758 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:42:38,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:42:38,759 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:42:38,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:42:38,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1209320918, now seen corresponding path program 1 times [2023-11-29 05:42:38,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:42:38,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235468296] [2023-11-29 05:42:38,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:38,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:42:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:38,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:42:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:39,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:42:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:39,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:42:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:39,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 05:42:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:39,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:42:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:39,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:42:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:39,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:42:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:39,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:42:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-29 05:42:39,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:42:39,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235468296] [2023-11-29 05:42:39,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235468296] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:42:39,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138936071] [2023-11-29 05:42:39,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:39,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:42:39,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:42:39,139 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:42:39,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 05:42:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:39,291 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:42:39,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:42:39,379 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-29 05:42:39,380 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:42:39,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138936071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:42:39,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:42:39,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-11-29 05:42:39,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143796147] [2023-11-29 05:42:39,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:42:39,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:42:39,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:42:39,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:42:39,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:42:39,381 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 05:42:39,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:42:39,413 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2023-11-29 05:42:39,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:42:39,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2023-11-29 05:42:39,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:42:39,414 INFO L225 Difference]: With dead ends: 94 [2023-11-29 05:42:39,414 INFO L226 Difference]: Without dead ends: 61 [2023-11-29 05:42:39,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:42:39,416 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:42:39,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 120 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:42:39,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-29 05:42:39,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-11-29 05:42:39,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 41 states have internal predecessors, (43), 12 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2023-11-29 05:42:39,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2023-11-29 05:42:39,422 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 57 [2023-11-29 05:42:39,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:42:39,423 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2023-11-29 05:42:39,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-29 05:42:39,423 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2023-11-29 05:42:39,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 05:42:39,424 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:42:39,424 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:42:39,429 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 05:42:39,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:42:39,625 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:42:39,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:42:39,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1272356003, now seen corresponding path program 1 times [2023-11-29 05:42:39,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:42:39,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73506981] [2023-11-29 05:42:39,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:39,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:42:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:40,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:42:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:40,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:42:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:40,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:42:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:40,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 05:42:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:40,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:42:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:40,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:42:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:40,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:42:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:40,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:42:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:40,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 05:42:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:40,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:42:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:40,521 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-29 05:42:40,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:42:40,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73506981] [2023-11-29 05:42:40,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73506981] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:42:40,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:42:40,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 05:42:40,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961469115] [2023-11-29 05:42:40,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:42:40,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 05:42:40,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:42:40,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 05:42:40,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:42:40,524 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 12 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-29 05:42:40,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:42:40,789 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2023-11-29 05:42:40,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:42:40,790 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 70 [2023-11-29 05:42:40,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:42:40,791 INFO L225 Difference]: With dead ends: 71 [2023-11-29 05:42:40,791 INFO L226 Difference]: Without dead ends: 69 [2023-11-29 05:42:40,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:42:40,792 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:42:40,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 264 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:42:40,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-29 05:42:40,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2023-11-29 05:42:40,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 46 states have internal predecessors, (47), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2023-11-29 05:42:40,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2023-11-29 05:42:40,802 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 70 [2023-11-29 05:42:40,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:42:40,802 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2023-11-29 05:42:40,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-29 05:42:40,803 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2023-11-29 05:42:40,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 05:42:40,803 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:42:40,803 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:42:40,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 05:42:40,804 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:42:40,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:42:40,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1247603931, now seen corresponding path program 1 times [2023-11-29 05:42:40,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:42:40,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190663510] [2023-11-29 05:42:40,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:40,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:42:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:41,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:42:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:41,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:42:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:41,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:42:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:41,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 05:42:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:41,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:42:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:41,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:42:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:41,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:42:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:41,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:42:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:41,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 05:42:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:41,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:42:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:41,614 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-29 05:42:41,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:42:41,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190663510] [2023-11-29 05:42:41,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190663510] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:42:41,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569182613] [2023-11-29 05:42:41,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:41,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:42:41,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:42:41,617 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:42:41,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 05:42:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:41,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-29 05:42:41,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:42:41,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 05:42:45,962 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.base_BEFORE_CALL_7| Int)) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_7| 8)) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.base_BEFORE_CALL_7| Int)) (not (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_7| 8)) 0)))) is different from true [2023-11-29 05:42:54,039 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.base_BEFORE_CALL_8| Int)) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_8| 8)) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.base_BEFORE_CALL_8| Int)) (not (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset_BEFORE_CALL_8| 8)) 0)))) is different from true [2023-11-29 05:42:58,136 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset_BEFORE_CALL_1| 8)) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base_BEFORE_CALL_1|) (+ |v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset_BEFORE_CALL_1| 8)) 0)))) is different from true [2023-11-29 05:43:02,213 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base_BEFORE_CALL_2| Int)) (not (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset_BEFORE_CALL_2| 8)) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base_BEFORE_CALL_2| Int)) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset_BEFORE_CALL_2| 8)) 0)))) is different from true [2023-11-29 05:43:10,290 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base_BEFORE_CALL_3| Int)) (not (= 0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset_BEFORE_CALL_3| 8))))) (exists ((|v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base_BEFORE_CALL_3| Int)) (not (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset_BEFORE_CALL_3| 8)) 0)))) is different from true [2023-11-29 05:43:22,609 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 12 not checked. [2023-11-29 05:43:22,609 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:43:26,982 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 05:43:26,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2023-11-29 05:43:26,993 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-11-29 05:43:26,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 05:43:27,004 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-29 05:43:27,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569182613] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:43:27,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:43:27,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 12] total 33 [2023-11-29 05:43:27,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115121423] [2023-11-29 05:43:27,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:43:27,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-29 05:43:27,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:43:27,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 05:43:27,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=663, Unknown=9, NotChecked=280, Total=1056 [2023-11-29 05:43:27,007 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 33 states, 32 states have (on average 2.25) internal successors, (72), 31 states have internal predecessors, (72), 9 states have call successors, (26), 7 states have call predecessors, (26), 10 states have return successors, (25), 8 states have call predecessors, (25), 8 states have call successors, (25) [2023-11-29 05:43:39,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:43:39,637 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2023-11-29 05:43:39,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 05:43:39,637 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 31 states have internal predecessors, (72), 9 states have call successors, (26), 7 states have call predecessors, (26), 10 states have return successors, (25), 8 states have call predecessors, (25), 8 states have call successors, (25) Word has length 70 [2023-11-29 05:43:39,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:43:39,638 INFO L225 Difference]: With dead ends: 85 [2023-11-29 05:43:39,638 INFO L226 Difference]: Without dead ends: 74 [2023-11-29 05:43:39,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 135 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 57.0s TimeCoverageRelationStatistics Valid=163, Invalid=1035, Unknown=12, NotChecked=350, Total=1560 [2023-11-29 05:43:39,639 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 28 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 648 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:43:39,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 297 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 487 Invalid, 0 Unknown, 648 Unchecked, 0.4s Time] [2023-11-29 05:43:39,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-29 05:43:39,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-11-29 05:43:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.0625) internal successors, (51), 51 states have internal predecessors, (51), 13 states have call successors, (13), 10 states have call predecessors, (13), 12 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2023-11-29 05:43:39,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2023-11-29 05:43:39,650 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 70 [2023-11-29 05:43:39,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:43:39,650 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2023-11-29 05:43:39,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 31 states have internal predecessors, (72), 9 states have call successors, (26), 7 states have call predecessors, (26), 10 states have return successors, (25), 8 states have call predecessors, (25), 8 states have call successors, (25) [2023-11-29 05:43:39,651 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2023-11-29 05:43:39,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 05:43:39,652 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:43:39,652 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:43:39,657 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 05:43:39,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-29 05:43:39,854 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:43:39,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:43:39,854 INFO L85 PathProgramCache]: Analyzing trace with hash -567545561, now seen corresponding path program 1 times [2023-11-29 05:43:39,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:43:39,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346053434] [2023-11-29 05:43:39,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:43:39,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:43:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:40,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:43:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:40,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:43:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:40,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:43:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:40,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 05:43:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:40,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:43:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:40,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:43:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:40,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:43:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:40,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:43:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:40,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 05:43:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:40,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:43:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:40,282 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-29 05:43:40,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:43:40,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346053434] [2023-11-29 05:43:40,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346053434] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:43:40,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188672217] [2023-11-29 05:43:40,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:43:40,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:43:40,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:43:40,283 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:43:40,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 05:43:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:40,404 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 05:43:40,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:43:40,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 05:43:40,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 05:43:40,567 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-11-29 05:43:40,567 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:43:40,756 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-29 05:43:40,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188672217] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:43:40,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:43:40,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 8] total 19 [2023-11-29 05:43:40,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475187635] [2023-11-29 05:43:40,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:43:40,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 05:43:40,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:43:40,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 05:43:40,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2023-11-29 05:43:40,759 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 19 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 8 states have call successors, (21), 2 states have call predecessors, (21), 5 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) [2023-11-29 05:43:41,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:43:41,070 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2023-11-29 05:43:41,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:43:41,070 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 8 states have call successors, (21), 2 states have call predecessors, (21), 5 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) Word has length 70 [2023-11-29 05:43:41,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:43:41,071 INFO L225 Difference]: With dead ends: 87 [2023-11-29 05:43:41,071 INFO L226 Difference]: Without dead ends: 65 [2023-11-29 05:43:41,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2023-11-29 05:43:41,072 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 26 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:43:41,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 351 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:43:41,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-29 05:43:41,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-11-29 05:43:41,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.0) internal successors, (43), 43 states have internal predecessors, (43), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 05:43:41,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2023-11-29 05:43:41,080 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 70 [2023-11-29 05:43:41,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:43:41,080 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2023-11-29 05:43:41,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 8 states have call successors, (21), 2 states have call predecessors, (21), 5 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) [2023-11-29 05:43:41,080 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2023-11-29 05:43:41,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-29 05:43:41,081 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:43:41,081 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:43:41,086 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 05:43:41,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 05:43:41,282 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:43:41,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:43:41,282 INFO L85 PathProgramCache]: Analyzing trace with hash -465805442, now seen corresponding path program 1 times [2023-11-29 05:43:41,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:43:41,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550218655] [2023-11-29 05:43:41,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:43:41,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:43:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:41,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:43:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:41,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:43:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:41,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:43:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:41,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 05:43:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:41,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:43:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:41,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:43:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:41,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:43:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:41,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:43:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:41,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 05:43:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:41,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 05:43:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:41,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 05:43:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:41,649 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-29 05:43:41,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:43:41,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550218655] [2023-11-29 05:43:41,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550218655] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:43:41,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:43:41,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:43:41,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425019049] [2023-11-29 05:43:41,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:43:41,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:43:41,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:43:41,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:43:41,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:43:41,651 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 05:43:41,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:43:41,760 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2023-11-29 05:43:41,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:43:41,760 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 76 [2023-11-29 05:43:41,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:43:41,761 INFO L225 Difference]: With dead ends: 65 [2023-11-29 05:43:41,761 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 05:43:41,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:43:41,762 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:43:41,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 212 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:43:41,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 05:43:41,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 05:43:41,763 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-29 05:43:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 05:43:41,763 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2023-11-29 05:43:41,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:43:41,763 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 05:43:41,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 05:43:41,763 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 05:43:41,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 05:43:41,766 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 05:43:41,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 05:43:41,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 05:43:42,321 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validEXIT(lines 4717 4721) no Hoare annotation was computed. [2023-11-29 05:43:42,321 INFO L899 garLoopResultBuilder]: For program point L4720-2(line 4720) no Hoare annotation was computed. [2023-11-29 05:43:42,321 INFO L899 garLoopResultBuilder]: For program point L4720(line 4720) no Hoare annotation was computed. [2023-11-29 05:43:42,321 INFO L899 garLoopResultBuilder]: For program point L4720-5(line 4720) no Hoare annotation was computed. [2023-11-29 05:43:42,321 INFO L899 garLoopResultBuilder]: For program point L4720-3(line 4720) no Hoare annotation was computed. [2023-11-29 05:43:42,321 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 4717 4721) the Hoare annotation is: true [2023-11-29 05:43:42,321 INFO L899 garLoopResultBuilder]: For program point L4731(line 4731) no Hoare annotation was computed. [2023-11-29 05:43:42,321 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validEXIT(lines 4728 4732) no Hoare annotation was computed. [2023-11-29 05:43:42,321 INFO L899 garLoopResultBuilder]: For program point L4731-5(line 4731) no Hoare annotation was computed. [2023-11-29 05:43:42,322 INFO L899 garLoopResultBuilder]: For program point L4731-2(line 4731) no Hoare annotation was computed. [2023-11-29 05:43:42,322 INFO L899 garLoopResultBuilder]: For program point L4731-3(line 4731) no Hoare annotation was computed. [2023-11-29 05:43:42,322 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 4728 4732) the Hoare annotation is: true [2023-11-29 05:43:42,322 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2023-11-29 05:43:42,322 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 210 212) the Hoare annotation is: true [2023-11-29 05:43:42,322 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2023-11-29 05:43:42,322 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2023-11-29 05:43:42,322 INFO L899 garLoopResultBuilder]: For program point L7391-1(line 7391) no Hoare annotation was computed. [2023-11-29 05:43:42,322 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 05:43:42,322 INFO L895 garLoopResultBuilder]: At program point L7391(line 7391) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| 8))) (let ((.cse1 (+ (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) 8)) (.cse3 (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) .cse4)) (.cse2 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) .cse4)) (.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (and (<= 2 |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$#2.offset| .cse0) .cse1) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| (select (select |#memory_$Pointer$#2.base| .cse0) .cse1)) (= (select (select |#memory_$Pointer$#3.base| .cse2) .cse3) |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$#3.offset| .cse2) .cse3)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset|) (not (= .cse2 0)) (not (= .cse0 0))))) [2023-11-29 05:43:42,322 INFO L899 garLoopResultBuilder]: For program point L7389-2(line 7389) no Hoare annotation was computed. [2023-11-29 05:43:42,323 INFO L895 garLoopResultBuilder]: At program point L7389-1(line 7389) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| 8))) (let ((.cse1 (+ (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) 8)) (.cse3 (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) .cse4)) (.cse2 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) .cse4)) (.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (and (<= 2 |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$#2.offset| .cse0) .cse1) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| (select (select |#memory_$Pointer$#2.base| .cse0) .cse1)) (= (select (select |#memory_$Pointer$#3.base| .cse2) .cse3) |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$#3.offset| .cse2) .cse3)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset|) (not (= .cse2 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_#t~ret680#1| 1) (not (= .cse0 0))))) [2023-11-29 05:43:42,323 INFO L895 garLoopResultBuilder]: At program point L7389(line 7389) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| 8))) (let ((.cse1 (+ (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) 8)) (.cse3 (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) .cse4)) (.cse2 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) .cse4)) (.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (and (<= 2 |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$#2.offset| .cse0) .cse1) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| (select (select |#memory_$Pointer$#2.base| .cse0) .cse1)) (= (select (select |#memory_$Pointer$#3.base| .cse2) .cse3) |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$#3.offset| .cse2) .cse3)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset|) (not (= .cse2 0)) (not (= .cse0 0))))) [2023-11-29 05:43:42,323 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 05:43:42,323 INFO L895 garLoopResultBuilder]: At program point L4840-1(line 4840) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0))) (let ((.cse1 (+ .cse2 8)) (.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base| .cse0) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= (select (select |#memory_$Pointer$#2.base| .cse0) .cse1) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| .cse2) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_#t~ret339#1| 1) (<= 2 |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= (select (select |#memory_$Pointer$#2.offset| .cse0) .cse1) 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|)))) [2023-11-29 05:43:42,323 INFO L899 garLoopResultBuilder]: For program point L4840-2(line 4840) no Hoare annotation was computed. [2023-11-29 05:43:42,324 INFO L895 garLoopResultBuilder]: At program point L4840(line 4840) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0))) (let ((.cse1 (+ .cse2 8)) (.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base| .cse0) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= (select (select |#memory_$Pointer$#2.base| .cse0) .cse1) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| .cse2) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (<= 2 |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= (select (select |#memory_$Pointer$#2.offset| .cse0) .cse1) 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|)))) [2023-11-29 05:43:42,324 INFO L895 garLoopResultBuilder]: At program point L7390(line 7390) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| 8))) (let ((.cse1 (+ (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) 8)) (.cse3 (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) .cse4)) (.cse2 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) .cse4)) (.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (and (<= 2 |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$#2.offset| .cse0) .cse1) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| (select (select |#memory_$Pointer$#2.base| .cse0) .cse1)) (= (select (select |#memory_$Pointer$#3.base| .cse2) .cse3) |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$#3.offset| .cse2) .cse3)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset|) (not (= .cse2 0)) (not (= .cse0 0))))) [2023-11-29 05:43:42,324 INFO L899 garLoopResultBuilder]: For program point L7390-2(line 7390) no Hoare annotation was computed. [2023-11-29 05:43:42,324 INFO L895 garLoopResultBuilder]: At program point L7390-1(line 7390) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| 8))) (let ((.cse1 (+ (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) 8)) (.cse3 (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) .cse4)) (.cse2 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) .cse4)) (.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (and (<= 2 |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$#2.offset| .cse0) .cse1) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| (select (select |#memory_$Pointer$#2.base| .cse0) .cse1)) (= (select (select |#memory_$Pointer$#3.base| .cse2) .cse3) |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$#3.offset| .cse2) .cse3)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset|) (not (= .cse2 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_#t~ret681#1| 1) (not (= .cse0 0))))) [2023-11-29 05:43:42,324 INFO L895 garLoopResultBuilder]: At program point L4839(line 4839) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0))) (let ((.cse1 (+ .cse2 8)) (.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base| .cse0) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= (select (select |#memory_$Pointer$#2.base| .cse0) .cse1) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| .cse2) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (<= 2 |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= (select (select |#memory_$Pointer$#2.offset| .cse0) .cse1) 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|)))) [2023-11-29 05:43:42,324 INFO L895 garLoopResultBuilder]: At program point L4839-1(line 4839) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0))) (let ((.cse1 (+ .cse2 8)) (.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base| .cse0) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (= (select (select |#memory_$Pointer$#2.base| .cse0) .cse1) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| .cse2) (= |ULTIMATE.start_aws_linked_list_next_#t~ret338#1| 1) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (<= 2 |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= (select (select |#memory_$Pointer$#2.offset| .cse0) .cse1) 0) (= .cse0 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|)))) [2023-11-29 05:43:42,325 INFO L895 garLoopResultBuilder]: At program point L4841(line 4841) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|)) (.cse1 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_#t~mem340#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_#t~mem340#1.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= (select (select |#memory_$Pointer$#2.base| .cse0) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (<= 2 |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= (select (select |#memory_$Pointer$#2.offset| .cse0) 8) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (not (= .cse1 0)))) [2023-11-29 05:43:42,325 INFO L899 garLoopResultBuilder]: For program point L4841-1(line 4841) no Hoare annotation was computed. [2023-11-29 05:43:42,325 INFO L899 garLoopResultBuilder]: For program point L4837-2(line 4837) no Hoare annotation was computed. [2023-11-29 05:43:42,325 INFO L895 garLoopResultBuilder]: At program point L4837(line 4837) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0))) (let ((.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0)) (.cse1 (+ .cse2 8))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base| .cse0) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (not (= 0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) 0))) (= (select (select |#memory_$Pointer$#2.base| .cse0) .cse1) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| .cse2) (<= 2 |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= (select (select |#memory_$Pointer$#2.offset| .cse0) .cse1) 0)))) [2023-11-29 05:43:42,325 INFO L899 garLoopResultBuilder]: For program point L4839-2(line 4839) no Hoare annotation was computed. [2023-11-29 05:43:42,325 INFO L895 garLoopResultBuilder]: At program point L4837-1(line 4837) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0))) (let ((.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) 0)) (.cse1 (+ .cse2 8))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) 0) 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base| .cse0) (= |ULTIMATE.start_aws_linked_list_next_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| 0) (not (= 0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) 0))) (= (select (select |#memory_$Pointer$#2.base| .cse0) .cse1) |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| .cse2) (<= 2 |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= (select (select |#memory_$Pointer$#2.offset| .cse0) .cse1) 0)))) [2023-11-29 05:43:42,325 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2023-11-29 05:43:42,325 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2023-11-29 05:43:42,326 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2023-11-29 05:43:42,326 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2023-11-29 05:43:42,326 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 222 224) the Hoare annotation is: true [2023-11-29 05:43:42,326 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2023-11-29 05:43:42,328 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:43:42,330 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:43:42,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:43:42 BoogieIcfgContainer [2023-11-29 05:43:42,334 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:43:42,334 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:43:42,334 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:43:42,334 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:43:42,335 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:42:29" (3/4) ... [2023-11-29 05:43:42,336 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 05:43:42,338 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2023-11-29 05:43:42,338 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_prev_is_valid [2023-11-29 05:43:42,339 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 05:43:42,339 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-29 05:43:42,343 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2023-11-29 05:43:42,343 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-29 05:43:42,343 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 05:43:42,343 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 05:43:42,420 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 05:43:42,420 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 05:43:42,420 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:43:42,421 INFO L158 Benchmark]: Toolchain (without parser) took 75402.32ms. Allocated memory was 163.6MB in the beginning and 450.9MB in the end (delta: 287.3MB). Free memory was 122.0MB in the beginning and 345.8MB in the end (delta: -223.8MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. [2023-11-29 05:43:42,421 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 111.1MB. Free memory was 59.2MB in the beginning and 59.1MB in the end (delta: 134.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:43:42,422 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2060.52ms. Allocated memory is still 163.6MB. Free memory was 121.6MB in the beginning and 105.4MB in the end (delta: 16.1MB). Peak memory consumption was 86.2MB. Max. memory is 16.1GB. [2023-11-29 05:43:42,422 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.44ms. Allocated memory is still 163.6MB. Free memory was 105.4MB in the beginning and 100.3MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:43:42,423 INFO L158 Benchmark]: Boogie Preprocessor took 61.41ms. Allocated memory is still 163.6MB. Free memory was 100.3MB in the beginning and 96.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:43:42,423 INFO L158 Benchmark]: RCFGBuilder took 456.34ms. Allocated memory is still 163.6MB. Free memory was 96.1MB in the beginning and 74.0MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 05:43:42,424 INFO L158 Benchmark]: TraceAbstraction took 72625.52ms. Allocated memory was 163.6MB in the beginning and 450.9MB in the end (delta: 287.3MB). Free memory was 73.1MB in the beginning and 351.0MB in the end (delta: -277.9MB). Peak memory consumption was 226.1MB. Max. memory is 16.1GB. [2023-11-29 05:43:42,424 INFO L158 Benchmark]: Witness Printer took 86.45ms. Allocated memory is still 450.9MB. Free memory was 351.0MB in the beginning and 345.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:43:42,426 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.17ms. Allocated memory is still 111.1MB. Free memory was 59.2MB in the beginning and 59.1MB in the end (delta: 134.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2060.52ms. Allocated memory is still 163.6MB. Free memory was 121.6MB in the beginning and 105.4MB in the end (delta: 16.1MB). Peak memory consumption was 86.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.44ms. Allocated memory is still 163.6MB. Free memory was 105.4MB in the beginning and 100.3MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.41ms. Allocated memory is still 163.6MB. Free memory was 100.3MB in the beginning and 96.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 456.34ms. Allocated memory is still 163.6MB. Free memory was 96.1MB in the beginning and 74.0MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 72625.52ms. Allocated memory was 163.6MB in the beginning and 450.9MB in the end (delta: 287.3MB). Free memory was 73.1MB in the beginning and 351.0MB in the end (delta: -277.9MB). Peak memory consumption was 226.1MB. Max. memory is 16.1GB. * Witness Printer took 86.45ms. Allocated memory is still 450.9MB. Free memory was 351.0MB in the beginning and 345.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: 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 5 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 72.6s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 218 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 174 mSDsluCounter, 3075 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 648 IncrementalHoareTripleChecker+Unchecked, 2444 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2105 IncrementalHoareTripleChecker+Invalid, 2826 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 631 mSDtfsCounter, 2105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 777 GetRequests, 579 SyntacticMatches, 12 SemanticMatches, 186 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 59.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=13, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 14 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 87 PreInvPairs, 98 NumberOfFragments, 1089 HoareAnnotationTreeSize, 87 FomulaSimplifications, 312 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 909 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 54.2s InterpolantComputationTime, 975 NumberOfCodeBlocks, 975 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1130 ConstructedInterpolants, 50 QuantifiedInterpolants, 6738 SizeOfPredicates, 55 NumberOfNonLiveVariables, 1373 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 23 InterpolantComputations, 13 PerfectInterpolantSequences, 620/694 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 RESULT: Ultimate proved your program to be correct! [2023-11-29 05:43:42,460 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_973c986d-7b8f-43cc-a6b6-d90a4fa3d7ef/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE