./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx --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 ce5362e495562dfaea277a751eacbf753e9d90aa85c88e38ea1b10dbc078ec49 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 21:05:03,044 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 21:05:03,171 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-21 21:05:03,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 21:05:03,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 21:05:03,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 21:05:03,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 21:05:03,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 21:05:03,222 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 21:05:03,228 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 21:05:03,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 21:05:03,229 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 21:05:03,230 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 21:05:03,232 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 21:05:03,232 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 21:05:03,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 21:05:03,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 21:05:03,234 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 21:05:03,234 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 21:05:03,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 21:05:03,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 21:05:03,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 21:05:03,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 21:05:03,237 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 21:05:03,238 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 21:05:03,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 21:05:03,239 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 21:05:03,239 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 21:05:03,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 21:05:03,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 21:05:03,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 21:05:03,242 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 21:05:03,242 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 21:05:03,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 21:05:03,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 21:05:03,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 21:05:03,244 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 21:05:03,244 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 21:05:03,244 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 21:05:03,244 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_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/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_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx 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 -> ce5362e495562dfaea277a751eacbf753e9d90aa85c88e38ea1b10dbc078ec49 [2023-11-21 21:05:03,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 21:05:03,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 21:05:03,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 21:05:03,590 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 21:05:03,590 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 21:05:03,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness.i [2023-11-21 21:05:06,782 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 21:05:07,349 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 21:05:07,350 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness.i [2023-11-21 21:05:07,419 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/data/87d0c317f/11452aa4bdf54f98bd5a9747a6f24061/FLAG50286c9db [2023-11-21 21:05:07,446 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/data/87d0c317f/11452aa4bdf54f98bd5a9747a6f24061 [2023-11-21 21:05:07,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 21:05:07,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 21:05:07,460 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 21:05:07,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 21:05:07,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 21:05:07,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:05:07" (1/1) ... [2023-11-21 21:05:07,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ec45fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:05:07, skipping insertion in model container [2023-11-21 21:05:07,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:05:07" (1/1) ... [2023-11-21 21:05:07,618 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 21:05:07,915 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_3a1155bc-c45e-46ca-ba05-62bfd19cda73/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness.i[4494,4507] [2023-11-21 21:05:07,925 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_3a1155bc-c45e-46ca-ba05-62bfd19cda73/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness.i[4554,4567] [2023-11-21 21:05:08,790 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-21 21:05:08,791 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-21 21:05:08,791 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-21 21:05:08,792 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-21 21:05:08,794 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-21 21:05:08,811 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-21 21:05:08,812 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-21 21:05:08,814 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-21 21:05:08,815 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-21 21:05:08,818 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-21 21:05:08,819 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-21 21:05:08,821 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-21 21:05:08,821 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-21 21:05:09,249 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-21 21:05:09,253 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-21 21:05:09,254 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-21 21:05:09,258 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-21 21:05:09,263 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-21 21:05:09,271 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-21 21:05:09,272 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-21 21:05:09,273 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-21 21:05:09,275 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-21 21:05:09,276 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-21 21:05:09,508 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:05:09,529 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 21:05:09,559 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_3a1155bc-c45e-46ca-ba05-62bfd19cda73/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness.i[4494,4507] [2023-11-21 21:05:09,560 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_3a1155bc-c45e-46ca-ba05-62bfd19cda73/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness.i[4554,4567] [2023-11-21 21:05:09,645 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-21 21:05:09,646 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-21 21:05:09,647 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-21 21:05:09,655 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-21 21:05:09,657 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-21 21:05:09,680 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-21 21:05:09,684 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-21 21:05:09,686 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-21 21:05:09,687 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-21 21:05:09,688 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-21 21:05:09,689 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-21 21:05:09,690 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-21 21:05:09,691 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-21 21:05:09,824 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-21 21:05:09,831 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-21 21:05:09,833 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-21 21:05:09,834 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-21 21:05:09,835 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-21 21:05:09,836 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-21 21:05:09,837 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-21 21:05:09,839 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-21 21:05:09,841 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-21 21:05:09,842 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-21 21:05:09,924 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:05:10,173 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:05:10,173 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:05:10,173 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:05:10,173 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:05:10,174 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:05:10,174 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:05:10,174 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:05:10,176 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:05:10,176 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:05:10,176 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:05:10,176 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:05:10,176 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:05:10,177 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:05:10,178 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:05:10,178 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:05:10,178 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:05:10,187 INFO L206 MainTranslator]: Completed translation [2023-11-21 21:05:10,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:05:10 WrapperNode [2023-11-21 21:05:10,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 21:05:10,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 21:05:10,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 21:05:10,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 21:05:10,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:05:10" (1/1) ... [2023-11-21 21:05:10,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:05:10" (1/1) ... [2023-11-21 21:05:10,354 INFO L138 Inliner]: procedures = 678, calls = 1040, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 135 [2023-11-21 21:05:10,355 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 21:05:10,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 21:05:10,356 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 21:05:10,356 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 21:05:10,368 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:05:10" (1/1) ... [2023-11-21 21:05:10,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:05:10" (1/1) ... [2023-11-21 21:05:10,375 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:05:10" (1/1) ... [2023-11-21 21:05:10,394 INFO L187 HeapSplitter]: Split 21 memory accesses to 3 slices as follows [2, 5, 14] [2023-11-21 21:05:10,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:05:10" (1/1) ... [2023-11-21 21:05:10,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:05:10" (1/1) ... [2023-11-21 21:05:10,408 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:05:10" (1/1) ... [2023-11-21 21:05:10,412 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:05:10" (1/1) ... [2023-11-21 21:05:10,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:05:10" (1/1) ... [2023-11-21 21:05:10,419 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:05:10" (1/1) ... [2023-11-21 21:05:10,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 21:05:10,426 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 21:05:10,426 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 21:05:10,426 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 21:05:10,428 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:05:10" (1/1) ... [2023-11-21 21:05:10,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 21:05:10,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:05:10,463 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 21:05:10,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 21:05:10,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 21:05:10,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-21 21:05:10,513 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-21 21:05:10,513 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-21 21:05:10,513 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-21 21:05:10,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 21:05:10,514 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-21 21:05:10,514 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-21 21:05:10,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 21:05:10,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-21 21:05:10,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-21 21:05:10,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-21 21:05:10,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 21:05:10,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 21:05:10,516 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-21 21:05:10,516 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-21 21:05:10,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 21:05:10,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-21 21:05:10,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-21 21:05:10,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-21 21:05:10,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-21 21:05:10,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-21 21:05:10,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-21 21:05:10,517 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-21 21:05:10,517 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-21 21:05:10,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 21:05:10,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-21 21:05:10,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-21 21:05:10,859 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 21:05:10,861 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 21:05:11,126 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 21:05:11,297 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 21:05:11,297 INFO L308 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-21 21:05:11,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:05:11 BoogieIcfgContainer [2023-11-21 21:05:11,299 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 21:05:11,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 21:05:11,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 21:05:11,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 21:05:11,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:05:07" (1/3) ... [2023-11-21 21:05:11,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0ae645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:05:11, skipping insertion in model container [2023-11-21 21:05:11,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:05:10" (2/3) ... [2023-11-21 21:05:11,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0ae645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:05:11, skipping insertion in model container [2023-11-21 21:05:11,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:05:11" (3/3) ... [2023-11-21 21:05:11,310 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rend_harness.i [2023-11-21 21:05:11,332 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 21:05:11,332 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-21 21:05:11,387 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 21:05:11,394 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;@15f43f8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 21:05:11,395 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 21:05:11,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-21 21:05:11,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-21 21:05:11,411 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:05:11,411 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:05:11,412 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 21:05:11,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:05:11,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1231067232, now seen corresponding path program 1 times [2023-11-21 21:05:11,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:05:11,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272126663] [2023-11-21 21:05:11,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:05:11,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:05:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:12,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:05:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:12,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-21 21:05:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:12,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-21 21:05:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:12,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-21 21:05:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:12,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-21 21:05:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:12,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-21 21:05:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:12,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-21 21:05:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:12,647 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-21 21:05:12,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:05:12,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272126663] [2023-11-21 21:05:12,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272126663] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:05:12,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489392734] [2023-11-21 21:05:12,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:05:12,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:05:12,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:05:12,653 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:05:12,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-21 21:05:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:13,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-21 21:05:13,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:05:13,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-21 21:05:13,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-21 21:05:13,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2023-11-21 21:05:13,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2023-11-21 21:05:15,974 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 21:05:15,976 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 21:05:15,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489392734] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:05:15,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 21:05:15,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2023-11-21 21:05:15,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842284649] [2023-11-21 21:05:15,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:05:15,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 21:05:15,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:05:16,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 21:05:16,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-21 21:05:16,034 INFO L87 Difference]: Start difference. First operand has 45 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-21 21:05:16,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:05:16,892 INFO L93 Difference]: Finished difference Result 121 states and 170 transitions. [2023-11-21 21:05:16,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:05:16,894 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 37 [2023-11-21 21:05:16,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:05:16,908 INFO L225 Difference]: With dead ends: 121 [2023-11-21 21:05:16,908 INFO L226 Difference]: Without dead ends: 79 [2023-11-21 21:05:16,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-21 21:05:16,924 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 32 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-21 21:05:16,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 339 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-21 21:05:16,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-21 21:05:17,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2023-11-21 21:05:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 43 states have (on average 1.302325581395349) internal successors, (56), 45 states have internal predecessors, (56), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-21 21:05:17,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 102 transitions. [2023-11-21 21:05:17,026 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 102 transitions. Word has length 37 [2023-11-21 21:05:17,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:05:17,027 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 102 transitions. [2023-11-21 21:05:17,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-21 21:05:17,028 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 102 transitions. [2023-11-21 21:05:17,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-21 21:05:17,031 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:05:17,031 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:05:17,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-21 21:05:17,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-21 21:05:17,254 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 21:05:17,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:05:17,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1753865417, now seen corresponding path program 1 times [2023-11-21 21:05:17,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:05:17,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038213890] [2023-11-21 21:05:17,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:05:17,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:05:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:17,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:05:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:17,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-21 21:05:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:17,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-21 21:05:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:17,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-21 21:05:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:17,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-21 21:05:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:17,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-21 21:05:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:17,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-21 21:05:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-21 21:05:17,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:05:17,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038213890] [2023-11-21 21:05:17,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038213890] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:05:17,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497582831] [2023-11-21 21:05:17,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:05:17,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:05:17,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:05:17,718 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:05:17,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 21:05:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:17,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 74 conjunts are in the unsatisfiable core [2023-11-21 21:05:17,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:05:18,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-21 21:05:18,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-21 21:05:18,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2023-11-21 21:05:18,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:05:18,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-21 21:05:18,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2023-11-21 21:05:18,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:05:18,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-21 21:05:18,331 INFO L349 Elim1Store]: treesize reduction 96, result has 23.2 percent of original size [2023-11-21 21:05:18,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 108 treesize of output 75 [2023-11-21 21:05:18,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:05:18,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:05:18,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2023-11-21 21:05:18,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-11-21 21:05:19,999 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-21 21:05:19,999 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:05:24,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:05:24,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 364 treesize of output 449 [2023-11-21 21:05:26,021 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-21 21:05:26,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 4 [2023-11-21 21:05:26,064 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-11-21 21:05:26,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 62 [2023-11-21 21:05:26,148 INFO L378 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 20 treesize of output 18 [2023-11-21 21:05:26,171 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:26,227 INFO L349 Elim1Store]: treesize reduction 54, result has 21.7 percent of original size [2023-11-21 21:05:26,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 78 treesize of output 81 [2023-11-21 21:05:26,525 INFO L349 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2023-11-21 21:05:26,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 130 treesize of output 121 [2023-11-21 21:05:26,607 INFO L378 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 20 treesize of output 18 [2023-11-21 21:05:26,621 INFO L378 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 20 treesize of output 18 [2023-11-21 21:05:26,693 INFO L349 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2023-11-21 21:05:26,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 130 treesize of output 121 [2023-11-21 21:05:26,988 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 8 |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset|)) (.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse3 (+ 16 |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| Int)) (or (forall ((v_ArrVal_178 Int) (v_prenex_5 Int) (v_prenex_6 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| v_prenex_6))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_5))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse3) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| 0))) (or (not (= |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_subst_3 Int)) (or (not (= (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| v_arrayElimArr_4))) (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_4 v_subst_3))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| 1)) (forall ((v_ArrVal_178 Int) (v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (not (= (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| v_prenex_4))) (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_3))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset|) 0))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| 1)) (forall ((v_ArrVal_178 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| v_prenex_2))) (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_prenex_1))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse8) 0)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| 1)) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_subst_4 Int)) (or (= (select (select (let ((.cse9 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| v_arrayElimArr_6))) (store .cse9 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse9 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse3) 0) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_6 v_subst_4))))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| 1)) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_DerPreprocessor_19 Int) (v_subst_3 Int) (v_subst_2 Int)) (or (forall ((v_subst_1 Int)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select (store v_arrayElimArr_6 v_subst_3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_1)))) (not (= v_DerPreprocessor_19 (select (store (store v_arrayElimArr_6 v_subst_3 v_DerPreprocessor_19) v_subst_2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_3))) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_6 v_subst_3))))) (= (select (select (let ((.cse10 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| v_arrayElimArr_6))) (store .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse3) 0))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_DerPreprocessor_19 Int) (v_subst_3 Int) (v_subst_2 Int)) (or (not (= v_DerPreprocessor_19 (select (store (store v_arrayElimArr_6 v_subst_3 v_DerPreprocessor_19) v_subst_2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_3))) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_6 v_subst_3))))) (= (select (select (let ((.cse11 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| v_arrayElimArr_6))) (store .cse11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse11 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse3) 0))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| 1)) (forall ((v_subst_4 Int) (v_subst_3 Int)) (or (forall ((v_subst_1 Int)) (or (= v_subst_4 v_subst_1) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimCell_20 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select (store (store v_arrayElimArr_6 v_subst_4 v_arrayElimCell_20) v_subst_3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_1))) (= (select (select (let ((.cse12 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| v_arrayElimArr_6))) (store .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse3) 0) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_6 v_subst_4))))))) (= v_subst_4 v_subst_3))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| Int)) (or (forall ((v_arrayElimArr_3 (Array Int Int)) (v_subst_1 Int)) (or (forall ((v_DerPreprocessor_29 Int) (v_subst_3 Int)) (not (= (select (store (store v_arrayElimArr_3 v_subst_1 v_DerPreprocessor_29) v_subst_3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_1) v_DerPreprocessor_29))) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_3 v_subst_1))) (= (select (select (let ((.cse13 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| v_arrayElimArr_3))) (store .cse13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse8) 0))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| Int)) (let ((.cse15 (+ |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset| 24))) (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_subst_2 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_5 v_subst_2))) (not (= (select (select (let ((.cse14 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| v_arrayElimArr_5))) (store .cse14 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse14 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse15) 0)))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| 1)) (forall ((v_ArrVal_178 Int) (v_ArrVal_184 Int) (v_ArrVal_188 (Array Int Int))) (not (= (select (select (let ((.cse16 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_178)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| v_ArrVal_188))) (store .cse16 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse16 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_184))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse15) 0))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| 0)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_subst_2 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_6 v_subst_2))) (= (select (select (let ((.cse17 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| v_arrayElimArr_6))) (store .cse17 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse17 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse3) 0))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_24| 0))))) is different from false [2023-11-21 21:05:27,482 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-21 21:05:27,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 144 [2023-11-21 21:05:27,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:05:27,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 230 treesize of output 204 [2023-11-21 21:05:27,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:05:27,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 154 [2023-11-21 21:05:27,675 INFO L378 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 3 [2023-11-21 21:05:27,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:05:27,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 73 [2023-11-21 21:05:27,787 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:27,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:05:27,796 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-21 21:05:27,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2023-11-21 21:05:27,801 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:27,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:05:27,810 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-21 21:05:27,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2023-11-21 21:05:27,816 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:27,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:05:27,826 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-21 21:05:27,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2023-11-21 21:05:27,834 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:27,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:05:27,872 INFO L349 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2023-11-21 21:05:27,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 37 [2023-11-21 21:05:27,879 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:27,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:05:27,900 INFO L349 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2023-11-21 21:05:27,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 37 [2023-11-21 21:05:27,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 85 [2023-11-21 21:05:27,919 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:27,920 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:27,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 72 [2023-11-21 21:05:27,929 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:27,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2023-11-21 21:05:27,942 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:27,943 INFO L378 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 31 treesize of output 23 [2023-11-21 21:05:27,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:05:27,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2023-11-21 21:05:27,985 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:27,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:05:27,991 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:27,992 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:27,996 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-21 21:05:27,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2023-11-21 21:05:28,000 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:28,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:05:28,005 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:28,006 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:28,009 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-21 21:05:28,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2023-11-21 21:05:28,015 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:28,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:05:28,020 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:28,021 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:28,025 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-21 21:05:28,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2023-11-21 21:05:28,030 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:28,031 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:28,035 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-21 21:05:28,040 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:28,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:05:28,045 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:28,045 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:28,049 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-21 21:05:28,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2023-11-21 21:05:28,150 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 1 not checked. [2023-11-21 21:05:28,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497582831] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:05:28,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:05:28,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 8] total 19 [2023-11-21 21:05:28,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214885858] [2023-11-21 21:05:28,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:05:28,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-21 21:05:28,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:05:28,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-21 21:05:28,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=253, Unknown=8, NotChecked=32, Total=342 [2023-11-21 21:05:28,154 INFO L87 Difference]: Start difference. First operand 77 states and 102 transitions. Second operand has 19 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 17 states have internal predecessors, (40), 7 states have call successors, (19), 4 states have call predecessors, (19), 7 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) [2023-11-21 21:05:31,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:05:31,134 INFO L93 Difference]: Finished difference Result 151 states and 204 transitions. [2023-11-21 21:05:31,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-21 21:05:31,135 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 17 states have internal predecessors, (40), 7 states have call successors, (19), 4 states have call predecessors, (19), 7 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) Word has length 38 [2023-11-21 21:05:31,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:05:31,138 INFO L225 Difference]: With dead ends: 151 [2023-11-21 21:05:31,138 INFO L226 Difference]: Without dead ends: 117 [2023-11-21 21:05:31,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=120, Invalid=682, Unknown=14, NotChecked=54, Total=870 [2023-11-21 21:05:31,141 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 84 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-21 21:05:31,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 334 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 418 Invalid, 0 Unknown, 111 Unchecked, 1.8s Time] [2023-11-21 21:05:31,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-21 21:05:31,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2023-11-21 21:05:31,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 64 states have (on average 1.3125) internal successors, (84), 69 states have internal predecessors, (84), 35 states have call successors, (35), 13 states have call predecessors, (35), 15 states have return successors, (36), 32 states have call predecessors, (36), 32 states have call successors, (36) [2023-11-21 21:05:31,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 155 transitions. [2023-11-21 21:05:31,180 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 155 transitions. Word has length 38 [2023-11-21 21:05:31,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:05:31,180 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 155 transitions. [2023-11-21 21:05:31,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 17 states have internal predecessors, (40), 7 states have call successors, (19), 4 states have call predecessors, (19), 7 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) [2023-11-21 21:05:31,181 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 155 transitions. [2023-11-21 21:05:31,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-21 21:05:31,184 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:05:31,184 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-21 21:05:31,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-21 21:05:31,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:05:31,406 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 21:05:31,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:05:31,406 INFO L85 PathProgramCache]: Analyzing trace with hash 127957683, now seen corresponding path program 1 times [2023-11-21 21:05:31,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:05:31,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483211880] [2023-11-21 21:05:31,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:05:31,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:05:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:31,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:05:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:31,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-21 21:05:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:31,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-21 21:05:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:31,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 21:05:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:31,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-21 21:05:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:31,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-21 21:05:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:31,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-21 21:05:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:31,758 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-21 21:05:31,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:05:31,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483211880] [2023-11-21 21:05:31,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483211880] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:05:31,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212575259] [2023-11-21 21:05:31,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:05:31,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:05:31,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:05:31,770 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:05:31,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-21 21:05:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:31,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-21 21:05:31,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:05:32,034 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-21 21:05:32,035 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 21:05:32,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212575259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:05:32,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 21:05:32,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-11-21 21:05:32,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218522704] [2023-11-21 21:05:32,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:05:32,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:05:32,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:05:32,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:05:32,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-21 21:05:32,038 INFO L87 Difference]: Start difference. First operand 115 states and 155 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-21 21:05:32,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:05:32,221 INFO L93 Difference]: Finished difference Result 226 states and 308 transitions. [2023-11-21 21:05:32,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:05:32,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 40 [2023-11-21 21:05:32,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:05:32,229 INFO L225 Difference]: With dead ends: 226 [2023-11-21 21:05:32,229 INFO L226 Difference]: Without dead ends: 124 [2023-11-21 21:05:32,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-11-21 21:05:32,239 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 27 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 21:05:32,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 150 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 21:05:32,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-21 21:05:32,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2023-11-21 21:05:32,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 74 states have internal predecessors, (88), 35 states have call successors, (35), 13 states have call predecessors, (35), 16 states have return successors, (38), 32 states have call predecessors, (38), 32 states have call successors, (38) [2023-11-21 21:05:32,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 161 transitions. [2023-11-21 21:05:32,301 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 161 transitions. Word has length 40 [2023-11-21 21:05:32,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:05:32,302 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 161 transitions. [2023-11-21 21:05:32,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-21 21:05:32,302 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 161 transitions. [2023-11-21 21:05:32,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-21 21:05:32,310 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:05:32,311 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-21 21:05:32,337 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-21 21:05:32,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:05:32,532 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 21:05:32,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:05:32,532 INFO L85 PathProgramCache]: Analyzing trace with hash -730728487, now seen corresponding path program 1 times [2023-11-21 21:05:32,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:05:32,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199669533] [2023-11-21 21:05:32,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:05:32,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:05:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:32,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:05:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:32,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-21 21:05:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:32,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-21 21:05:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:32,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-21 21:05:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:32,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-21 21:05:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:32,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-21 21:05:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:32,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-21 21:05:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:32,865 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-21 21:05:32,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:05:32,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199669533] [2023-11-21 21:05:32,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199669533] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:05:32,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861936315] [2023-11-21 21:05:32,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:05:32,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:05:32,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:05:32,868 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:05:32,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-21 21:05:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:33,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-21 21:05:33,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:05:33,167 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-21 21:05:33,167 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 21:05:33,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861936315] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:05:33,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 21:05:33,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2023-11-21 21:05:33,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083186213] [2023-11-21 21:05:33,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:05:33,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 21:05:33,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:05:33,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 21:05:33,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-21 21:05:33,172 INFO L87 Difference]: Start difference. First operand 120 states and 161 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-21 21:05:33,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:05:33,429 INFO L93 Difference]: Finished difference Result 261 states and 359 transitions. [2023-11-21 21:05:33,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:05:33,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 42 [2023-11-21 21:05:33,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:05:33,433 INFO L225 Difference]: With dead ends: 261 [2023-11-21 21:05:33,433 INFO L226 Difference]: Without dead ends: 154 [2023-11-21 21:05:33,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-11-21 21:05:33,435 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 51 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 21:05:33,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 176 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 21:05:33,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-21 21:05:33,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 126. [2023-11-21 21:05:33,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 80 states have internal predecessors, (97), 35 states have call successors, (35), 13 states have call predecessors, (35), 16 states have return successors, (38), 32 states have call predecessors, (38), 32 states have call successors, (38) [2023-11-21 21:05:33,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 170 transitions. [2023-11-21 21:05:33,490 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 170 transitions. Word has length 42 [2023-11-21 21:05:33,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:05:33,490 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 170 transitions. [2023-11-21 21:05:33,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-21 21:05:33,491 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 170 transitions. [2023-11-21 21:05:33,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-21 21:05:33,493 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:05:33,493 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-21 21:05:33,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-21 21:05:33,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:05:33,709 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 21:05:33,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:05:33,709 INFO L85 PathProgramCache]: Analyzing trace with hash 939354714, now seen corresponding path program 1 times [2023-11-21 21:05:33,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:05:33,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86285220] [2023-11-21 21:05:33,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:05:33,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:05:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:33,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:05:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:33,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-21 21:05:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:33,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-21 21:05:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:34,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-21 21:05:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:34,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-21 21:05:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:34,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-21 21:05:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:34,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-21 21:05:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:34,048 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-21 21:05:34,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:05:34,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86285220] [2023-11-21 21:05:34,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86285220] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:05:34,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78586584] [2023-11-21 21:05:34,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:05:34,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:05:34,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:05:34,050 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:05:34,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-21 21:05:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:34,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 21:05:34,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:05:34,308 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-21 21:05:34,308 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 21:05:34,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78586584] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:05:34,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 21:05:34,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-11-21 21:05:34,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988107736] [2023-11-21 21:05:34,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:05:34,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:05:34,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:05:34,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:05:34,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 21:05:34,313 INFO L87 Difference]: Start difference. First operand 126 states and 170 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-21 21:05:34,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:05:34,403 INFO L93 Difference]: Finished difference Result 254 states and 356 transitions. [2023-11-21 21:05:34,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:05:34,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2023-11-21 21:05:34,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:05:34,407 INFO L225 Difference]: With dead ends: 254 [2023-11-21 21:05:34,407 INFO L226 Difference]: Without dead ends: 141 [2023-11-21 21:05:34,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 21:05:34,409 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 21:05:34,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 84 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 21:05:34,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-21 21:05:34,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 129. [2023-11-21 21:05:34,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 83 states have internal predecessors, (100), 35 states have call successors, (35), 13 states have call predecessors, (35), 16 states have return successors, (38), 32 states have call predecessors, (38), 32 states have call successors, (38) [2023-11-21 21:05:34,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 173 transitions. [2023-11-21 21:05:34,455 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 173 transitions. Word has length 43 [2023-11-21 21:05:34,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:05:34,457 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 173 transitions. [2023-11-21 21:05:34,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-21 21:05:34,457 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 173 transitions. [2023-11-21 21:05:34,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-21 21:05:34,459 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:05:34,459 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-21 21:05:34,486 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-21 21:05:34,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:05:34,672 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 21:05:34,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:05:34,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1669765998, now seen corresponding path program 1 times [2023-11-21 21:05:34,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:05:34,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580835939] [2023-11-21 21:05:34,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:05:34,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:05:34,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:34,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-21 21:05:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:34,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-21 21:05:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:34,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-21 21:05:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:35,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-21 21:05:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:35,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-21 21:05:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:35,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-21 21:05:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:35,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-21 21:05:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:35,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-21 21:05:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:35,163 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-21 21:05:35,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:05:35,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580835939] [2023-11-21 21:05:35,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580835939] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:05:35,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435753594] [2023-11-21 21:05:35,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:05:35,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:05:35,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:05:35,166 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:05:35,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-21 21:05:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:05:35,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 74 conjunts are in the unsatisfiable core [2023-11-21 21:05:35,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:05:35,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-21 21:05:35,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-21 21:05:35,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2023-11-21 21:05:35,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:05:35,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-21 21:05:35,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2023-11-21 21:05:35,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:05:35,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-21 21:05:35,739 INFO L349 Elim1Store]: treesize reduction 96, result has 23.2 percent of original size [2023-11-21 21:05:35,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 108 treesize of output 75 [2023-11-21 21:05:35,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:05:35,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:05:35,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2023-11-21 21:05:35,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-11-21 21:05:38,213 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 21:05:38,213 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:05:41,966 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 16 |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset|)) (.cse4 (+ 8 |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset|)) (.cse6 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24))) (and (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_599 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_601))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_599))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_599 Int)) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_601))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_599))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse4) 0)) (or (not (= |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset| 0))) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int)) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)))) (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0)) (or (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_599 Int)) (not (= (select (select (let ((.cse7 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_601))) (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_599))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset|) 0))) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int)) (not (= (select (select (let ((.cse8 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)))) (store .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset|) 0)))) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int)) (= (select (select (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)))) (store .cse9 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse9 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse4) 0)) (let ((.cse11 (+ |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset| 24))) (or (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int)) (not (= (select (select (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse6 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)))) (store .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse11) 0))) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_599 Int)) (not (= (select (select (let ((.cse12 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_601))) (store .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_599))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse11) 0))))))) is different from false [2023-11-21 21:05:42,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:05:42,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 364 treesize of output 449 [2023-11-21 21:05:43,234 INFO L349 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2023-11-21 21:05:43,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 130 treesize of output 121 [2023-11-21 21:05:43,390 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-21 21:05:43,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 24 [2023-11-21 21:05:43,708 INFO L349 Elim1Store]: treesize reduction 179, result has 25.4 percent of original size [2023-11-21 21:05:43,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 346 treesize of output 355 [2023-11-21 21:05:44,139 INFO L349 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2023-11-21 21:05:44,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 130 treesize of output 121 [2023-11-21 21:05:44,271 INFO L349 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2023-11-21 21:05:44,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 236 treesize of output 201 [2023-11-21 21:05:44,407 INFO L349 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2023-11-21 21:05:44,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 236 treesize of output 201 [2023-11-21 21:05:44,477 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-21 21:05:44,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 4 [2023-11-21 21:05:44,495 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-21 21:05:44,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 4 [2023-11-21 21:05:44,510 INFO L378 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 6 treesize of output 4 [2023-11-21 21:05:44,513 INFO L378 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 6 treesize of output 4 [2023-11-21 21:05:44,520 INFO L378 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 6 treesize of output 4 [2023-11-21 21:05:46,752 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (+ 8 |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset|)) (.cse7 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (.cse9 (+ 16 |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| Int)) (let ((.cse5 (+ |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset| 24))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| 0) (forall ((v_arrayElimArr_23 (Array Int Int)) (v_subst_7 Int) (v_subst_6 Int) (v_subst_5 Int) (v_DerPreprocessor_64 Int) (v_DerPreprocessor_74 Int)) (let ((.cse1 (store v_arrayElimArr_23 v_subst_6 v_DerPreprocessor_74)) (.cse0 (store (store v_arrayElimArr_23 v_subst_6 v_DerPreprocessor_64) v_subst_7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|))) (or (not (= v_DerPreprocessor_64 (select .cse0 v_subst_6))) (not (= v_DerPreprocessor_74 (select (store .cse1 v_subst_5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) v_subst_6))) (not (= (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| v_arrayElimArr_23))) (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse5) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_23 v_subst_6))) (not (= (store (store .cse1 v_subst_5 (select .cse0 v_subst_5)) v_subst_7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse0))))) (forall ((v_ArrVal_593 Int) (v_prenex_40 (Array Int Int)) (v_prenex_41 Int)) (not (= (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_593)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| v_prenex_40))) (store .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse6 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_41))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse5) 0)))))) (or (not (= |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base| 0)) (not (= |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset| 0))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| 0) (forall ((v_ArrVal_601 (Array Int Int)) (v_ArrVal_599 Int) (v_ArrVal_593 Int)) (= (select (select (let ((.cse8 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_593)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| v_ArrVal_601))) (store .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse8 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_ArrVal_599))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse9) 0)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| 0) (forall ((v_prenex_45 Int) (v_ArrVal_593 Int) (v_prenex_44 (Array Int Int))) (= (select (select (let ((.cse10 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_593)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| v_prenex_44))) (store .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse10 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_45))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse11) 0)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| 0) (forall ((v_arrayElimArr_25 (Array Int Int)) (v_subst_5 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_25 v_subst_5))) (= (select (select (let ((.cse12 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| v_arrayElimArr_25))) (store .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse12 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse11) 0))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| 1)) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| 0) (forall ((v_prenex_42 (Array Int Int)) (v_ArrVal_593 Int) (v_prenex_43 Int)) (not (= 0 (select (select (let ((.cse13 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse7 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_593)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| v_prenex_42))) (store .cse13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse13 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 v_prenex_43))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset|)))) (forall ((v_arrayElimArr_24 (Array Int Int)) (v_subst_7 Int)) (or (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_24 v_subst_7))) (not (= 0 (select (select (let ((.cse14 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| v_arrayElimArr_24))) (store .cse14 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse14 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset|))))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| 1)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_subst_8 Int)) (or (= (select (select (let ((.cse15 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| v_arrayElimArr_22))) (store .cse15 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse15 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse9) 0) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_22 v_subst_8))))) (= |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_28| 0))))) is different from false [2023-11-21 21:05:46,972 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2023-11-21 21:05:46,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 144 [2023-11-21 21:05:46,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:05:46,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 230 treesize of output 204 [2023-11-21 21:05:47,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:05:47,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 154 [2023-11-21 21:05:47,075 INFO L378 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 8 treesize of output 4 [2023-11-21 21:05:47,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:05:47,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 73 [2023-11-21 21:05:47,274 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:47,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:05:47,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 21:05:47,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 46 [2023-11-21 21:05:47,293 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:47,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2023-11-21 21:05:47,306 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:47,318 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-21 21:05:47,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 31 [2023-11-21 21:05:47,327 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:47,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:05:47,331 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:47,332 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:47,335 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-21 21:05:47,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2023-11-21 21:05:47,340 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:47,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 21:05:47,344 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:47,344 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:47,350 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-21 21:05:47,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 1 [2023-11-21 21:05:47,356 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:47,356 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:47,359 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-21 21:05:47,364 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:47,364 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 21:05:47,367 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-21 21:05:47,481 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 1 not checked. [2023-11-21 21:05:47,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435753594] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:05:47,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:05:47,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 22 [2023-11-21 21:05:47,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260690173] [2023-11-21 21:05:47,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:05:47,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-21 21:05:47,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:05:47,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-21 21:05:47,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=330, Unknown=2, NotChecked=74, Total=462 [2023-11-21 21:05:47,485 INFO L87 Difference]: Start difference. First operand 129 states and 173 transitions. Second operand has 22 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 21 states have internal predecessors, (60), 10 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) [2023-11-21 21:05:50,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:05:50,772 INFO L93 Difference]: Finished difference Result 269 states and 363 transitions. [2023-11-21 21:05:50,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-21 21:05:50,772 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 21 states have internal predecessors, (60), 10 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) Word has length 46 [2023-11-21 21:05:50,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 21:05:50,774 INFO L225 Difference]: With dead ends: 269 [2023-11-21 21:05:50,775 INFO L226 Difference]: Without dead ends: 151 [2023-11-21 21:05:50,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=187, Invalid=1301, Unknown=2, NotChecked=150, Total=1640 [2023-11-21 21:05:50,777 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 85 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 276 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-21 21:05:50,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 766 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 909 Invalid, 0 Unknown, 276 Unchecked, 1.8s Time] [2023-11-21 21:05:50,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-21 21:05:50,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 96. [2023-11-21 21:05:50,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 64 states have internal predecessors, (74), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (32), 22 states have call predecessors, (32), 22 states have call successors, (32) [2023-11-21 21:05:50,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 130 transitions. [2023-11-21 21:05:50,816 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 130 transitions. Word has length 46 [2023-11-21 21:05:50,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 21:05:50,817 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 130 transitions. [2023-11-21 21:05:50,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 21 states have internal predecessors, (60), 10 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (21), 8 states have call predecessors, (21), 10 states have call successors, (21) [2023-11-21 21:05:50,817 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 130 transitions. [2023-11-21 21:05:50,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-21 21:05:50,819 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 21:05:50,819 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:05:50,841 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a1155bc-c45e-46ca-ba05-62bfd19cda73/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0