./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 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_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl --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 aabf7ad166d752d3872d668e3b551e8cefeb907fee1d51e6917a6895600694bb --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:16:42,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:16:43,061 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-12 02:16:43,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:16:43,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:16:43,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:16:43,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:16:43,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:16:43,119 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:16:43,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:16:43,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:16:43,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:16:43,128 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:16:43,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:16:43,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:16:43,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:16:43,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:16:43,132 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:16:43,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:16:43,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:16:43,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:16:43,134 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:16:43,135 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:16:43,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:16:43,135 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:16:43,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:16:43,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:16:43,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:16:43,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:16:43,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:16:43,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:16:43,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:16:43,140 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:16:43,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:16:43,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:16:43,140 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:16:43,141 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_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/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_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl 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 -> aabf7ad166d752d3872d668e3b551e8cefeb907fee1d51e6917a6895600694bb [2023-11-12 02:16:43,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:16:43,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:16:43,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:16:43,511 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:16:43,511 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:16:43,513 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i [2023-11-12 02:16:46,645 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:16:47,144 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:16:47,145 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i [2023-11-12 02:16:47,179 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/data/ca06853f7/5bda890d47da40fe8205bace6d2ea131/FLAGb481eb618 [2023-11-12 02:16:47,194 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/data/ca06853f7/5bda890d47da40fe8205bace6d2ea131 [2023-11-12 02:16:47,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:16:47,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:16:47,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:16:47,201 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:16:47,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:16:47,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:16:47" (1/1) ... [2023-11-12 02:16:47,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47d13cda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:47, skipping insertion in model container [2023-11-12 02:16:47,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:16:47" (1/1) ... [2023-11-12 02:16:47,323 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:16:47,584 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_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[4496,4509] [2023-11-12 02:16:47,592 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_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[4556,4569] [2023-11-12 02:16:48,572 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 02:16:48,573 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 02:16:48,574 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 02:16:48,575 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 02:16:48,576 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 02:16:48,594 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 02:16:48,595 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 02:16:48,597 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 02:16:48,598 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 02:16:48,600 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 02:16:48,602 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 02:16:48,603 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 02:16:48,603 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 02:16:49,141 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-12 02:16:49,142 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-12 02:16:49,144 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-12 02:16:49,146 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-12 02:16:49,161 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-12 02:16:49,162 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-12 02:16:49,164 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-12 02:16:49,166 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-12 02:16:49,167 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-12 02:16:49,171 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-12 02:16:49,493 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:16:49,521 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:16:49,544 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_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[4496,4509] [2023-11-12 02:16:49,545 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_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/sv-benchmarks/c/aws-c-common/aws_linked_list_remove_harness_negated.i[4556,4569] [2023-11-12 02:16:49,629 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 02:16:49,629 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 02:16:49,630 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 02:16:49,630 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 02:16:49,632 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 02:16:49,647 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 02:16:49,654 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 02:16:49,660 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 02:16:49,660 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 02:16:49,662 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 02:16:49,663 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 02:16:49,663 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 02:16:49,664 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-12 02:16:49,789 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-12 02:16:49,791 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-12 02:16:49,792 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-12 02:16:49,793 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-12 02:16:49,794 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-12 02:16:49,794 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-12 02:16:49,795 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-12 02:16:49,796 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-12 02:16:49,796 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-12 02:16:49,797 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-12 02:16:49,863 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:16:50,106 WARN L672 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:16:50,107 WARN L672 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:16:50,107 WARN L672 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:16:50,107 WARN L672 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:16:50,107 WARN L672 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:16:50,107 WARN L672 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:16:50,108 WARN L672 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:16:50,108 WARN L672 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:16:50,108 WARN L672 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:16:50,109 WARN L672 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:16:50,109 WARN L672 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:16:50,110 WARN L672 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:16:50,110 WARN L672 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:16:50,110 WARN L672 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:16:50,110 WARN L672 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:16:50,119 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:16:50,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:50 WrapperNode [2023-11-12 02:16:50,121 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:16:50,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:16:50,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:16:50,125 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:16:50,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:50" (1/1) ... [2023-11-12 02:16:50,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:50" (1/1) ... [2023-11-12 02:16:50,325 INFO L138 Inliner]: procedures = 678, calls = 1048, calls flagged for inlining = 49, calls inlined = 4, statements flattened = 87 [2023-11-12 02:16:50,326 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:16:50,327 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:16:50,327 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:16:50,327 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:16:50,337 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:50" (1/1) ... [2023-11-12 02:16:50,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:50" (1/1) ... [2023-11-12 02:16:50,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:50" (1/1) ... [2023-11-12 02:16:50,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:50" (1/1) ... [2023-11-12 02:16:50,357 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:50" (1/1) ... [2023-11-12 02:16:50,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:50" (1/1) ... [2023-11-12 02:16:50,386 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:50" (1/1) ... [2023-11-12 02:16:50,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:50" (1/1) ... [2023-11-12 02:16:50,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:16:50,400 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:16:50,400 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:16:50,401 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:16:50,401 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:50" (1/1) ... [2023-11-12 02:16:50,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:16:50,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:50,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:16:50,481 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2023-11-12 02:16:50,481 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2023-11-12 02:16:50,481 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2023-11-12 02:16:50,481 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2023-11-12 02:16:50,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:16:50,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:16:50,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-12 02:16:50,482 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-12 02:16:50,482 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-12 02:16:50,482 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-12 02:16:50,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:16:50,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 02:16:50,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:16:50,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:16:50,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2023-11-12 02:16:50,483 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2023-11-12 02:16:50,483 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:16:50,484 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:16:50,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:16:50,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 02:16:50,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 02:16:50,484 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-12 02:16:50,484 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-12 02:16:50,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:16:50,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:16:50,777 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:16:50,782 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:16:51,140 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:16:51,147 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:16:51,147 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-12 02:16:51,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:16:51 BoogieIcfgContainer [2023-11-12 02:16:51,149 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:16:51,156 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:16:51,157 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:16:51,160 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:16:51,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:16:47" (1/3) ... [2023-11-12 02:16:51,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e153ce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:16:51, skipping insertion in model container [2023-11-12 02:16:51,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:50" (2/3) ... [2023-11-12 02:16:51,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e153ce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:16:51, skipping insertion in model container [2023-11-12 02:16:51,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:16:51" (3/3) ... [2023-11-12 02:16:51,163 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_remove_harness_negated.i [2023-11-12 02:16:51,185 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:16:51,185 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:16:51,238 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:16:51,245 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;@7ae680c1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:16:51,245 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:16:51,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 50 states have internal predecessors, (62), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-12 02:16:51,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-12 02:16:51,260 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:16:51,260 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:51,261 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:16:51,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:51,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1155526354, now seen corresponding path program 1 times [2023-11-12 02:16:51,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:51,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873636413] [2023-11-12 02:16:51,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:51,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:52,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-12 02:16:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:52,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:16:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:52,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-12 02:16:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:52,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-12 02:16:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:52,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:16:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:52,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:16:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:52,349 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 02:16:52,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:52,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873636413] [2023-11-12 02:16:52,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873636413] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:52,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:52,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:16:52,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847001183] [2023-11-12 02:16:52,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:52,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:16:52,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:52,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:16:52,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:16:52,409 INFO L87 Difference]: Start difference. First operand has 74 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 50 states have internal predecessors, (62), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-12 02:16:52,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:16:52,637 INFO L93 Difference]: Finished difference Result 147 states and 204 transitions. [2023-11-12 02:16:52,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:16:52,640 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2023-11-12 02:16:52,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:16:52,650 INFO L225 Difference]: With dead ends: 147 [2023-11-12 02:16:52,650 INFO L226 Difference]: Without dead ends: 73 [2023-11-12 02:16:52,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:16:52,660 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 28 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:16:52,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 433 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:16:52,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-12 02:16:52,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2023-11-12 02:16:52,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 47 states have internal predecessors, (55), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-12 02:16:52,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2023-11-12 02:16:52,731 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 48 [2023-11-12 02:16:52,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:16:52,732 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2023-11-12 02:16:52,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-12 02:16:52,734 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2023-11-12 02:16:52,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-12 02:16:52,743 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:16:52,743 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:52,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:16:52,745 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:16:52,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:52,747 INFO L85 PathProgramCache]: Analyzing trace with hash 209823880, now seen corresponding path program 1 times [2023-11-12 02:16:52,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:52,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232369121] [2023-11-12 02:16:52,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:52,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:53,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-12 02:16:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:53,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:16:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:53,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-12 02:16:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:53,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-12 02:16:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:53,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:16:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:53,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-12 02:16:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:53,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:16:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:53,301 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 02:16:53,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:53,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232369121] [2023-11-12 02:16:53,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232369121] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:53,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:53,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 02:16:53,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660642171] [2023-11-12 02:16:53,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:53,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:16:53,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:53,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:16:53,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:16:53,306 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand has 8 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-12 02:16:53,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:16:53,797 INFO L93 Difference]: Finished difference Result 143 states and 178 transitions. [2023-11-12 02:16:53,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 02:16:53,798 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2023-11-12 02:16:53,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:16:53,801 INFO L225 Difference]: With dead ends: 143 [2023-11-12 02:16:53,802 INFO L226 Difference]: Without dead ends: 77 [2023-11-12 02:16:53,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:16:53,808 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 66 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:16:53,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 156 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:16:53,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-12 02:16:53,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2023-11-12 02:16:53,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.1875) internal successors, (57), 50 states have internal predecessors, (57), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2023-11-12 02:16:53,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2023-11-12 02:16:53,842 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 54 [2023-11-12 02:16:53,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:16:53,842 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2023-11-12 02:16:53,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-12 02:16:53,843 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2023-11-12 02:16:53,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-12 02:16:53,847 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:16:53,847 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:53,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:16:53,847 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:16:53,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:53,848 INFO L85 PathProgramCache]: Analyzing trace with hash 637356428, now seen corresponding path program 1 times [2023-11-12 02:16:53,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:53,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253955732] [2023-11-12 02:16:53,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:53,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:54,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-12 02:16:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:54,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:16:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:54,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-12 02:16:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:54,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-12 02:16:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:54,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:16:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:54,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-12 02:16:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:54,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:16:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 02:16:54,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:54,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253955732] [2023-11-12 02:16:54,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253955732] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:54,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:54,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:16:54,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718918171] [2023-11-12 02:16:54,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:54,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:16:54,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:54,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:16:54,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:16:54,260 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-12 02:16:54,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:16:54,560 INFO L93 Difference]: Finished difference Result 131 states and 161 transitions. [2023-11-12 02:16:54,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:16:54,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2023-11-12 02:16:54,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:16:54,563 INFO L225 Difference]: With dead ends: 131 [2023-11-12 02:16:54,563 INFO L226 Difference]: Without dead ends: 75 [2023-11-12 02:16:54,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:16:54,565 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 39 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:16:54,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 130 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:16:54,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-12 02:16:54,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-11-12 02:16:54,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.183673469387755) internal successors, (58), 51 states have internal predecessors, (58), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2023-11-12 02:16:54,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2023-11-12 02:16:54,577 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 54 [2023-11-12 02:16:54,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:16:54,577 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2023-11-12 02:16:54,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-12 02:16:54,578 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2023-11-12 02:16:54,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-12 02:16:54,579 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:16:54,579 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:54,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:16:54,580 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:16:54,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:54,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1815633941, now seen corresponding path program 1 times [2023-11-12 02:16:54,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:54,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856338679] [2023-11-12 02:16:54,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:54,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:54,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-12 02:16:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:54,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:16:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:54,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-12 02:16:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:54,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-12 02:16:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:54,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:16:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:54,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-12 02:16:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:55,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-12 02:16:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:55,135 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 02:16:55,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:55,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856338679] [2023-11-12 02:16:55,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856338679] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:16:55,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101463302] [2023-11-12 02:16:55,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:55,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:16:55,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:55,144 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:16:55,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 02:16:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:55,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-12 02:16:55,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:16:55,529 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 02:16:55,544 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:16:55,671 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-12 02:16:55,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101463302] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-12 02:16:55,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-12 02:16:55,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 6] total 11 [2023-11-12 02:16:55,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609804929] [2023-11-12 02:16:55,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:55,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:16:55,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:55,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:16:55,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:16:55,674 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-12 02:16:55,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:16:55,708 INFO L93 Difference]: Finished difference Result 125 states and 153 transitions. [2023-11-12 02:16:55,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:16:55,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2023-11-12 02:16:55,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:16:55,713 INFO L225 Difference]: With dead ends: 125 [2023-11-12 02:16:55,713 INFO L226 Difference]: Without dead ends: 78 [2023-11-12 02:16:55,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:16:55,717 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 4 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:16:55,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 241 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:16:55,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-12 02:16:55,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2023-11-12 02:16:55,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.18) internal successors, (59), 52 states have internal predecessors, (59), 17 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2023-11-12 02:16:55,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2023-11-12 02:16:55,742 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 55 [2023-11-12 02:16:55,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:16:55,742 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2023-11-12 02:16:55,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-12 02:16:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2023-11-12 02:16:55,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-12 02:16:55,744 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:16:55,744 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:55,757 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 02:16:55,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:16:55,951 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:16:55,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:55,952 INFO L85 PathProgramCache]: Analyzing trace with hash -247571742, now seen corresponding path program 1 times [2023-11-12 02:16:55,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:55,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144904544] [2023-11-12 02:16:55,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:55,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:56,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-12 02:16:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:56,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:16:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:56,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-12 02:16:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:56,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-12 02:16:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:56,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:16:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:56,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-12 02:16:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:56,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-12 02:16:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:56,525 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-12 02:16:56,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:56,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144904544] [2023-11-12 02:16:56,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144904544] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:56,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:56,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:16:56,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133529142] [2023-11-12 02:16:56,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:56,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:16:56,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:56,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:16:56,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:16:56,528 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-12 02:16:56,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:16:56,885 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2023-11-12 02:16:56,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:16:56,885 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2023-11-12 02:16:56,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:16:56,887 INFO L225 Difference]: With dead ends: 86 [2023-11-12 02:16:56,887 INFO L226 Difference]: Without dead ends: 84 [2023-11-12 02:16:56,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:16:56,888 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 44 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:16:56,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 201 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:16:56,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-12 02:16:56,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2023-11-12 02:16:56,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 57 states have internal predecessors, (63), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2023-11-12 02:16:56,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2023-11-12 02:16:56,924 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 55 [2023-11-12 02:16:56,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:16:56,924 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 100 transitions. [2023-11-12 02:16:56,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-12 02:16:56,925 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2023-11-12 02:16:56,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-12 02:16:56,926 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:16:56,927 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:56,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:16:56,927 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:16:56,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:56,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1922469302, now seen corresponding path program 1 times [2023-11-12 02:16:56,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:56,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659245764] [2023-11-12 02:16:56,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:56,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:57,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-12 02:16:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:57,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:16:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:57,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-12 02:16:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:57,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-12 02:16:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:57,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:16:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:57,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-12 02:16:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:57,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-12 02:16:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:57,429 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-12 02:16:57,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:57,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659245764] [2023-11-12 02:16:57,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659245764] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:16:57,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312956315] [2023-11-12 02:16:57,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:57,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:16:57,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:57,432 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:16:57,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 02:16:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:57,702 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-12 02:16:57,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:16:57,759 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-12 02:16:57,760 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:16:57,867 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-12 02:16:57,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312956315] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:16:57,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:16:57,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2023-11-12 02:16:57,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868630031] [2023-11-12 02:16:57,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:16:57,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 02:16:57,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:57,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 02:16:57,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:16:57,871 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-12 02:16:58,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:16:58,318 INFO L93 Difference]: Finished difference Result 152 states and 184 transitions. [2023-11-12 02:16:58,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 02:16:58,320 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 58 [2023-11-12 02:16:58,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:16:58,322 INFO L225 Difference]: With dead ends: 152 [2023-11-12 02:16:58,322 INFO L226 Difference]: Without dead ends: 86 [2023-11-12 02:16:58,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-11-12 02:16:58,323 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 39 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:16:58,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 203 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:16:58,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-12 02:16:58,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-11-12 02:16:58,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 60 states have internal predecessors, (66), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2023-11-12 02:16:58,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2023-11-12 02:16:58,341 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 58 [2023-11-12 02:16:58,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:16:58,342 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2023-11-12 02:16:58,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-12 02:16:58,343 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2023-11-12 02:16:58,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-12 02:16:58,346 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:16:58,347 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:58,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 02:16:58,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-12 02:16:58,554 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:16:58,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:58,556 INFO L85 PathProgramCache]: Analyzing trace with hash 393886901, now seen corresponding path program 2 times [2023-11-12 02:16:58,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:58,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331665779] [2023-11-12 02:16:58,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:58,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:58,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-12 02:16:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:58,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:16:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:58,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-12 02:16:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:58,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-12 02:16:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:58,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:16:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:58,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-12 02:16:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:59,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-12 02:16:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:59,297 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-12 02:16:59,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:59,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331665779] [2023-11-12 02:16:59,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331665779] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:16:59,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571559238] [2023-11-12 02:16:59,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-12 02:16:59,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:16:59,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:59,299 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:16:59,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 02:16:59,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-12 02:16:59,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:16:59,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-12 02:16:59,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:16:59,883 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-12 02:16:59,884 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:17:00,064 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-12 02:17:00,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571559238] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:17:00,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:17:00,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 5] total 17 [2023-11-12 02:17:00,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845089318] [2023-11-12 02:17:00,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:17:00,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-12 02:17:00,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:17:00,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-12 02:17:00,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-11-12 02:17:00,067 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 16 states have internal predecessors, (65), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-12 02:17:01,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:17:01,201 INFO L93 Difference]: Finished difference Result 172 states and 208 transitions. [2023-11-12 02:17:01,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-12 02:17:01,202 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 16 states have internal predecessors, (65), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 61 [2023-11-12 02:17:01,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:17:01,204 INFO L225 Difference]: With dead ends: 172 [2023-11-12 02:17:01,204 INFO L226 Difference]: Without dead ends: 102 [2023-11-12 02:17:01,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2023-11-12 02:17:01,206 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 89 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-12 02:17:01,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 331 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-12 02:17:01,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-12 02:17:01,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2023-11-12 02:17:01,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 70 states have internal predecessors, (79), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2023-11-12 02:17:01,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2023-11-12 02:17:01,226 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 61 [2023-11-12 02:17:01,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:17:01,226 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2023-11-12 02:17:01,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 16 states have internal predecessors, (65), 2 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-12 02:17:01,227 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2023-11-12 02:17:01,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-12 02:17:01,228 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:17:01,228 INFO L195 NwaCegarLoop]: trace histogram [5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:17:01,236 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 02:17:01,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:17:01,436 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:17:01,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:17:01,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1877660159, now seen corresponding path program 1 times [2023-11-12 02:17:01,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:17:01,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868119737] [2023-11-12 02:17:01,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:01,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:17:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:01,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-12 02:17:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:01,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:17:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:01,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-12 02:17:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:01,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-12 02:17:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:01,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:17:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:01,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-12 02:17:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:02,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:17:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:02,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-12 02:17:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:02,321 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-12 02:17:02,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:17:02,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868119737] [2023-11-12 02:17:02,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868119737] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:17:02,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7202504] [2023-11-12 02:17:02,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:17:02,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:17:02,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:17:02,324 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:17:02,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2346f9f1-4ef7-4dc6-b540-2e1992bcb884/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 02:17:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:17:02,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-12 02:17:02,649 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:17:02,769 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 63 [2023-11-12 02:17:02,809 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 146 treesize of output 133 [2023-11-12 02:17:02,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:17:02,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:17:02,828 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-11-12 02:17:02,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:17:02,887 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2023-11-12 02:17:02,896 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 26 [2023-11-12 02:17:02,902 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-12 02:17:02,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:17:02,916 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-11-12 02:17:02,927 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-12 02:17:03,377 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|))) (let ((.cse0 (select .cse1 0))) (and (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| .cse0)) (= .cse0 (select .cse1 8)) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|) (not (= .cse0 0)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse3 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse2 (select .cse6 0))) (and (not (= .cse2 .cse3)) (not (= .cse3 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| 0)) (<= 2 .cse3) (= (store (select (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_1))) (let ((.cse4 (store (select (store (store .cse5 .cse3 v_DerPreprocessor_2) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse3) 8 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))) (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse3 .cse4) .cse2 (store (select (store (store .cse5 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse3 .cse4) .cse2) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse3)))) .cse3) 0 .cse2) .cse6))))))) is different from true [2023-11-12 02:17:03,978 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse6 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse6))) (let ((.cse5 (select .cse9 0))) (and (not (= .cse5 .cse6)) (not (= .cse6 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| 0)) (<= 2 .cse6) (= (store (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_1))) (let ((.cse7 (store (select (store (store .cse8 .cse6 v_DerPreprocessor_2) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse6) 8 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))) (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse6 .cse7) .cse5 (store (select (store (store .cse8 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse6 .cse7) .cse5) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse6)))) .cse6) 0 .cse5) .cse9)))))))) (and (or .cse0 (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| Int)) (let ((.cse2 (select |c_#memory_$Pointer$.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))) (let ((.cse1 (select .cse2 0))) (and (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| .cse1)) (not (= .cse1 0)) (= (select .cse2 8) .cse1) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|)))))) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| Int)) (let ((.cse4 (select |c_#memory_$Pointer$.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|))) (let ((.cse3 (select .cse4 0))) (and (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| .cse3)) (= .cse3 (select .cse4 8)) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|) (not (= .cse3 0)))))) .cse0))) is different from true [2023-11-12 02:17:04,867 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse8 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse8))) (let ((.cse7 (select .cse11 0))) (and (not (= .cse7 .cse8)) (not (= .cse8 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| 0)) (<= 2 .cse8) (= (store (select (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_1))) (let ((.cse9 (store (select (store (store .cse10 .cse8 v_DerPreprocessor_2) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse8) 8 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))) (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse8 .cse9) .cse7 (store (select (store (store .cse10 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse8 .cse9) .cse7) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse8)))) .cse8) 0 .cse7) .cse11)))))))) (and (or .cse0 (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| Int)) (let ((.cse2 (select |c_#memory_$Pointer$.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))) (let ((.cse1 (select .cse2 0))) (and (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| .cse1)) (not (= .cse1 0)) (= (select .cse2 8) .cse1) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|)))))) (or .cse0 (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| Int)) (let ((.cse4 (select |c_#memory_$Pointer$.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|))) (let ((.cse3 (select .cse4 0))) (and (= .cse3 (select .cse4 8)) (not (= .cse3 0)) (not (= .cse3 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|)) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|)))))) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| Int)) (let ((.cse6 (select |c_#memory_$Pointer$.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|))) (let ((.cse5 (select .cse6 0))) (and (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| .cse5)) (= .cse5 (select .cse6 8)) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|) (not (= .cse5 0)))))) .cse0))) is different from true [2023-11-12 02:17:06,234 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse10 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse13 (select |c_#memory_$Pointer$.base| .cse10))) (let ((.cse9 (select .cse13 0))) (and (not (= .cse9 .cse10)) (not (= .cse10 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| 0)) (<= 2 .cse10) (= (store (select (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_1))) (let ((.cse11 (store (select (store (store .cse12 .cse10 v_DerPreprocessor_2) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse10) 8 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))) (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse10 .cse11) .cse9 (store (select (store (store .cse12 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse10 .cse11) .cse9) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse10)))) .cse10) 0 .cse9) .cse13)))))))) (and (or .cse0 (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| Int)) (let ((.cse2 (select |c_#memory_$Pointer$.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))) (let ((.cse1 (select .cse2 0))) (and (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| .cse1)) (not (= .cse1 0)) (= (select .cse2 8) .cse1) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|)))))) (or .cse0 (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| Int)) (let ((.cse4 (select |c_#memory_$Pointer$.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|))) (let ((.cse3 (select .cse4 0))) (and (= .cse3 (select .cse4 8)) (not (= .cse3 0)) (not (= .cse3 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|)) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|)))))) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| Int)) (let ((.cse6 (select |c_#memory_$Pointer$.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|))) (let ((.cse5 (select .cse6 0))) (and (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| .cse5)) (= .cse5 (select .cse6 8)) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|) (not (= .cse5 0)))))) .cse0) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4| Int)) (let ((.cse8 (select |c_#memory_$Pointer$.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4|))) (let ((.cse7 (select .cse8 0))) (and (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4|) (not (= .cse7 0)) (= .cse7 (select .cse8 8)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4| .cse7)))))) .cse0))) is different from true [2023-11-12 02:17:07,027 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (let ((.cse15 (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|))) (let ((.cse18 (select |c_#memory_$Pointer$.base| .cse15))) (let ((.cse14 (select .cse18 0))) (and (not (= .cse14 .cse15)) (not (= .cse15 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| 0)) (<= 2 .cse15) (= (store (select (let ((.cse17 (store |c_#memory_$Pointer$.base| .cse14 v_DerPreprocessor_1))) (let ((.cse16 (store (select (store (store .cse17 .cse15 v_DerPreprocessor_2) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse15) 8 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))) (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse15 .cse16) .cse14 (store (select (store (store .cse17 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) .cse15 .cse16) .cse14) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) .cse15)))) .cse15) 0 .cse14) .cse18)))))))) (and (<= 2 |c_aws_linked_list_remove_~node#1.base|) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_aws_linked_list_remove_~node#1.base|))) (let ((.cse0 (select .cse2 0))) (let ((.cse1 (not (= .cse0 |c_aws_linked_list_remove_~node#1.base|)))) (or (and (not (= .cse0 0)) .cse1 (= .cse0 (select .cse2 8))) (and .cse1 (exists ((v_DerPreprocessor_1 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| Int) (|ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| Int) (v_DerPreprocessor_2 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset| Int)) (and (= (store (select (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1))) (let ((.cse3 (store (select (store (store .cse4 |c_aws_linked_list_remove_~node#1.base| v_DerPreprocessor_2) |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) |c_aws_linked_list_remove_~node#1.base|) 8 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|))) (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) |c_aws_linked_list_remove_~node#1.base| .cse3) .cse0 (store (select (store (store .cse4 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| v_arrayElimArr_2) |c_aws_linked_list_remove_~node#1.base| .cse3) .cse0) (+ |ULTIMATE.start_aws_linked_list_remove_harness_~#next~0#1.offset| 8) |c_aws_linked_list_remove_~node#1.base|)))) |c_aws_linked_list_remove_~node#1.base|) 0 .cse0) .cse2) (= (select v_arrayElimArr_2 |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.offset|) |c_aws_linked_list_remove_~node#1.base|) (not (= |c_aws_linked_list_remove_~node#1.base| |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base|)) (not (= |ULTIMATE.start_aws_linked_list_remove_harness_~#prev~0#1.base| 0))))))))) (or .cse5 (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| Int)) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|))) (let ((.cse6 (select .cse7 0))) (and (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2| .cse6)) (not (= .cse6 0)) (= (select .cse7 8) .cse6) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_2|)))))) (or .cse5 (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3| Int)) (let ((.cse9 (select |c_#memory_$Pointer$.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|))) (let ((.cse8 (select .cse9 0))) (and (= .cse8 (select .cse9 8)) (not (= .cse8 0)) (not (= .cse8 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|)) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_3|)))))) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| Int)) (let ((.cse11 (select |c_#memory_$Pointer$.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|))) (let ((.cse10 (select .cse11 0))) (and (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1| .cse10)) (= .cse10 (select .cse11 8)) (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_1|) (not (= .cse10 0)))))) .cse5) (or (exists ((|v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4| Int)) (let ((.cse13 (select |c_#memory_$Pointer$.base| |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4|))) (let ((.cse12 (select .cse13 0))) (and (<= 2 |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4|) (not (= .cse12 0)) (= .cse12 (select .cse13 8)) (not (= |v_aws_linked_list_remove_~node#1.base_BEFORE_CALL_4| .cse12)))))) .cse5) (= |c_aws_linked_list_remove_~node#1.offset| 0))) is different from true [2023-11-12 02:17:10,387 INFO L322 Elim1Store]: treesize reduction 814, result has 39.7 percent of original size [2023-11-12 02:17:10,389 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 14 new quantified variables, introduced 56 case distinctions, treesize of input 3165 treesize of output 2798 [2023-11-12 02:17:10,552 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 192 treesize of output 160 [2023-11-12 02:17:10,609 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 190 treesize of output 158 [2023-11-12 02:17:10,658 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 188 treesize of output 156 [2023-11-12 02:17:10,717 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 186 treesize of output 154 [2023-11-12 02:17:10,777 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 53 treesize of output 58 [2023-11-12 02:17:10,884 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 53 treesize of output 58 [2023-11-12 02:17:10,983 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 17 [2023-11-12 02:17:11,044 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 53 treesize of output 58 [2023-11-12 02:17:11,149 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 53 treesize of output 58 [2023-11-12 02:17:11,278 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 66 treesize of output 71 [2023-11-12 02:17:11,422 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 60 treesize of output 58 [2023-11-12 02:17:11,694 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 [2023-11-12 02:17:11,921 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 [2023-11-12 02:17:12,037 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 [2023-11-12 02:17:12,265 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 [2023-11-12 02:17:13,712 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-12 02:17:15,456 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12