./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 364b54724e976c015f9881f66521e5c6d863e13e3a8324ac15c0186b650523fa --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:57:39,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:57:39,860 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-06 22:57:39,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:57:39,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:57:39,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:57:39,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:57:39,891 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:57:39,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:57:39,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:57:39,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:57:39,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:57:39,895 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:57:39,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:57:39,896 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:57:39,897 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:57:39,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:57:39,898 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:57:39,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:57:39,899 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:57:39,900 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:57:39,901 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:57:39,901 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:57:39,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:57:39,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:57:39,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:57:39,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:57:39,904 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:57:39,905 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:57:39,905 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:57:39,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:57:39,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:57:39,907 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:57:39,908 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:57:39,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:57:39,909 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:57:39,909 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_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 364b54724e976c015f9881f66521e5c6d863e13e3a8324ac15c0186b650523fa [2023-11-06 22:57:40,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:57:40,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:57:40,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:57:40,179 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:57:40,180 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:57:40,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i [2023-11-06 22:57:43,177 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:57:43,849 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:57:43,850 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f239dd5f-be90-4463-9093-7a4b7b1c95eb/sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i [2023-11-06 22:57:43,913 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP/data/a1074dc94/9eb389da7d704b23a9474a5b9ff23361/FLAGc2f43f6b6 [2023-11-06 22:57:43,935 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP/data/a1074dc94/9eb389da7d704b23a9474a5b9ff23361 [2023-11-06 22:57:43,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:57:43,944 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:57:43,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:57:43,948 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:57:43,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:57:43,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:57:43" (1/1) ... [2023-11-06 22:57:43,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b4775d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:43, skipping insertion in model container [2023-11-06 22:57:43,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:57:43" (1/1) ... [2023-11-06 22:57:44,117 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:57:44,474 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_f239dd5f-be90-4463-9093-7a4b7b1c95eb/sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i[4499,4512] [2023-11-06 22:57:44,484 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_f239dd5f-be90-4463-9093-7a4b7b1c95eb/sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i[4559,4572] [2023-11-06 22:57:45,747 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:57:45,748 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:57:45,748 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:57:45,749 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:57:45,751 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:57:45,785 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:57:45,786 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:57:45,797 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:57:45,798 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:57:46,193 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-06 22:57:46,194 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-06 22:57:46,195 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-06 22:57:46,197 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-06 22:57:46,199 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-06 22:57:46,199 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-06 22:57:46,200 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-06 22:57:46,201 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-06 22:57:46,202 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-06 22:57:46,203 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-06 22:57:46,601 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:57:46,602 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:57:46,694 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:57:46,752 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:57:46,776 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_f239dd5f-be90-4463-9093-7a4b7b1c95eb/sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i[4499,4512] [2023-11-06 22:57:46,776 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_f239dd5f-be90-4463-9093-7a4b7b1c95eb/sv-benchmarks/c/aws-c-common/aws_string_new_from_array_harness.i[4559,4572] [2023-11-06 22:57:46,812 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:57:46,812 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:57:46,813 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:57:46,813 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:57:46,814 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:57:46,820 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:57:46,820 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:57:46,821 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:57:46,822 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:57:46,853 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-06 22:57:46,854 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-06 22:57:46,855 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-06 22:57:46,856 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-06 22:57:46,857 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-06 22:57:46,858 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-06 22:57:46,858 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-06 22:57:46,859 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-06 22:57:46,859 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-06 22:57:46,860 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-06 22:57:47,002 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8269] [2023-11-06 22:57:47,004 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:57:47,004 WARN L1577 CHandler]: Possible shadowing of function index [2023-11-06 22:57:47,021 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8755-8766] [2023-11-06 22:57:47,103 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:57:47,457 WARN L672 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:57:47,457 WARN L672 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:57:47,459 WARN L672 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:57:47,459 WARN L672 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:57:47,460 WARN L672 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:57:47,460 WARN L672 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:57:47,460 WARN L672 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:57:47,460 WARN L672 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:57:47,460 WARN L672 CHandler]: The function fprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:57:47,460 WARN L672 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:57:47,461 WARN L672 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:57:47,461 WARN L672 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:57:47,461 WARN L672 CHandler]: The function predicate is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:57:47,462 WARN L672 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:57:47,462 WARN L672 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:57:47,462 WARN L672 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:57:47,462 WARN L672 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:57:47,463 WARN L672 CHandler]: The function memchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:57:47,471 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:57:47,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:47 WrapperNode [2023-11-06 22:57:47,472 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:57:47,474 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:57:47,474 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:57:47,474 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:57:47,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:47" (1/1) ... [2023-11-06 22:57:47,612 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:47" (1/1) ... [2023-11-06 22:57:47,709 INFO L138 Inliner]: procedures = 689, calls = 2740, calls flagged for inlining = 58, calls inlined = 6, statements flattened = 792 [2023-11-06 22:57:47,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:57:47,710 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:57:47,710 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:57:47,710 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:57:47,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:47" (1/1) ... [2023-11-06 22:57:47,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:47" (1/1) ... [2023-11-06 22:57:47,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:47" (1/1) ... [2023-11-06 22:57:47,739 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:47" (1/1) ... [2023-11-06 22:57:47,802 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:47" (1/1) ... [2023-11-06 22:57:47,806 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:47" (1/1) ... [2023-11-06 22:57:47,813 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:47" (1/1) ... [2023-11-06 22:57:47,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:47" (1/1) ... [2023-11-06 22:57:47,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:57:47,831 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:57:47,831 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:57:47,832 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:57:47,832 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:47" (1/1) ... [2023-11-06 22:57:47,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:57:47,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:57:47,878 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:57:47,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:57:47,929 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2023-11-06 22:57:47,930 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2023-11-06 22:57:47,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:57:47,930 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2023-11-06 22:57:47,930 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2023-11-06 22:57:47,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2023-11-06 22:57:47,931 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2023-11-06 22:57:47,932 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2023-11-06 22:57:47,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2023-11-06 22:57:47,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-11-06 22:57:47,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:57:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2023-11-06 22:57:47,933 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2023-11-06 22:57:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2023-11-06 22:57:47,934 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2023-11-06 22:57:47,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-06 22:57:47,934 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-06 22:57:47,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:57:47,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:57:47,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 22:57:47,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:57:47,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:57:47,935 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2023-11-06 22:57:47,936 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2023-11-06 22:57:47,936 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2023-11-06 22:57:47,936 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2023-11-06 22:57:47,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2023-11-06 22:57:47,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-11-06 22:57:47,936 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2023-11-06 22:57:47,936 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2023-11-06 22:57:47,937 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:57:47,937 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:57:47,937 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2023-11-06 22:57:47,937 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2023-11-06 22:57:47,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:57:47,938 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2023-11-06 22:57:47,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2023-11-06 22:57:47,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 22:57:47,938 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_new_from_array [2023-11-06 22:57:47,939 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_new_from_array [2023-11-06 22:57:47,939 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2023-11-06 22:57:47,939 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2023-11-06 22:57:47,940 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2023-11-06 22:57:47,940 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2023-11-06 22:57:47,940 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-06 22:57:47,940 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-06 22:57:47,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:57:47,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2023-11-06 22:57:47,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:57:48,249 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:57:48,252 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:57:48,554 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !true; [2023-11-06 22:57:50,030 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:57:50,037 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:57:50,037 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 22:57:50,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:57:50 BoogieIcfgContainer [2023-11-06 22:57:50,040 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:57:50,042 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:57:50,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:57:50,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:57:50,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:57:43" (1/3) ... [2023-11-06 22:57:50,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55996d9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:57:50, skipping insertion in model container [2023-11-06 22:57:50,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:57:47" (2/3) ... [2023-11-06 22:57:50,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55996d9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:57:50, skipping insertion in model container [2023-11-06 22:57:50,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:57:50" (3/3) ... [2023-11-06 22:57:50,048 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_string_new_from_array_harness.i [2023-11-06 22:57:50,068 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:57:50,068 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:57:50,128 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:57:50,139 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5c338cd7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:57:50,140 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:57:50,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 83 states have internal predecessors, (97), 33 states have call successors, (33), 16 states have call predecessors, (33), 16 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-11-06 22:57:50,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-06 22:57:50,159 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:57:50,160 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:57:50,160 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:57:50,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:57:50,167 INFO L85 PathProgramCache]: Analyzing trace with hash -2057633121, now seen corresponding path program 1 times [2023-11-06 22:57:50,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:57:50,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982232561] [2023-11-06 22:57:50,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:57:50,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:57:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:50,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:57:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:50,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-06 22:57:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:50,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:57:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:50,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:57:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:50,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:57:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:50,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:57:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:50,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:57:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:51,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:57:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:51,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:57:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:51,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:57:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:51,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:57:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:51,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:57:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:51,110 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-06 22:57:51,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:57:51,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982232561] [2023-11-06 22:57:51,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982232561] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:57:51,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:57:51,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:57:51,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044027261] [2023-11-06 22:57:51,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:57:51,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:57:51,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:57:51,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:57:51,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:57:51,152 INFO L87 Difference]: Start difference. First operand has 133 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 83 states have internal predecessors, (97), 33 states have call successors, (33), 16 states have call predecessors, (33), 16 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:57:51,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:57:51,743 INFO L93 Difference]: Finished difference Result 277 states and 358 transitions. [2023-11-06 22:57:51,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:57:51,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 71 [2023-11-06 22:57:51,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:57:51,757 INFO L225 Difference]: With dead ends: 277 [2023-11-06 22:57:51,757 INFO L226 Difference]: Without dead ends: 144 [2023-11-06 22:57:51,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:57:51,765 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 60 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:57:51,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 159 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:57:51,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-06 22:57:51,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 127. [2023-11-06 22:57:51,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.1428571428571428) internal successors, (88), 78 states have internal predecessors, (88), 33 states have call successors, (33), 16 states have call predecessors, (33), 16 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-06 22:57:51,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 153 transitions. [2023-11-06 22:57:51,825 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 153 transitions. Word has length 71 [2023-11-06 22:57:51,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:57:51,825 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 153 transitions. [2023-11-06 22:57:51,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:57:51,826 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 153 transitions. [2023-11-06 22:57:51,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-06 22:57:51,830 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:57:51,831 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:57:51,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:57:51,831 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:57:51,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:57:51,832 INFO L85 PathProgramCache]: Analyzing trace with hash 866247645, now seen corresponding path program 1 times [2023-11-06 22:57:51,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:57:51,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424385589] [2023-11-06 22:57:51,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:57:51,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:57:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:52,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:57:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:52,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-06 22:57:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:52,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:57:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:52,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:57:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:52,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:57:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:52,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:57:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:52,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:57:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:52,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:57:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:52,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:57:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:52,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:57:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:52,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:57:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:52,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:57:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-06 22:57:52,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:57:52,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424385589] [2023-11-06 22:57:52,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424385589] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:57:52,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:57:52,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:57:52,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822928186] [2023-11-06 22:57:52,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:57:52,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:57:52,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:57:52,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:57:52,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:57:52,792 INFO L87 Difference]: Start difference. First operand 127 states and 153 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:57:53,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:57:53,762 INFO L93 Difference]: Finished difference Result 188 states and 225 transitions. [2023-11-06 22:57:53,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:57:53,763 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 71 [2023-11-06 22:57:53,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:57:53,766 INFO L225 Difference]: With dead ends: 188 [2023-11-06 22:57:53,767 INFO L226 Difference]: Without dead ends: 149 [2023-11-06 22:57:53,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:57:53,769 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 62 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:57:53,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 314 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:57:53,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-11-06 22:57:53,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 132. [2023-11-06 22:57:53,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 82 states have internal predecessors, (92), 33 states have call successors, (33), 16 states have call predecessors, (33), 17 states have return successors, (33), 33 states have call predecessors, (33), 32 states have call successors, (33) [2023-11-06 22:57:53,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 158 transitions. [2023-11-06 22:57:53,792 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 158 transitions. Word has length 71 [2023-11-06 22:57:53,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:57:53,793 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 158 transitions. [2023-11-06 22:57:53,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:57:53,794 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 158 transitions. [2023-11-06 22:57:53,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-06 22:57:53,797 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:57:53,798 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:57:53,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:57:53,798 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:57:53,799 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:57:53,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1202353843, now seen corresponding path program 1 times [2023-11-06 22:57:53,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:57:53,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590182302] [2023-11-06 22:57:53,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:57:53,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:57:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:54,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:57:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:54,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-06 22:57:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:54,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:57:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:54,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:57:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:54,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:57:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:54,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:57:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:54,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:57:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:54,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:57:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:54,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:57:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:54,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:57:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:54,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:57:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:54,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:57:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:54,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:57:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:54,642 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-06 22:57:54,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:57:54,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590182302] [2023-11-06 22:57:54,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590182302] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:57:54,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:57:54,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:57:54,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620299264] [2023-11-06 22:57:54,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:57:54,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:57:54,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:57:54,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:57:54,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:57:54,653 INFO L87 Difference]: Start difference. First operand 132 states and 158 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:57:55,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:57:55,632 INFO L93 Difference]: Finished difference Result 203 states and 248 transitions. [2023-11-06 22:57:55,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:57:55,633 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 77 [2023-11-06 22:57:55,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:57:55,636 INFO L225 Difference]: With dead ends: 203 [2023-11-06 22:57:55,636 INFO L226 Difference]: Without dead ends: 162 [2023-11-06 22:57:55,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:57:55,638 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 139 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:57:55,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 328 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:57:55,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-11-06 22:57:55,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 127. [2023-11-06 22:57:55,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 78 states have internal predecessors, (86), 33 states have call successors, (33), 16 states have call predecessors, (33), 16 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-06 22:57:55,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 151 transitions. [2023-11-06 22:57:55,658 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 151 transitions. Word has length 77 [2023-11-06 22:57:55,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:57:55,659 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 151 transitions. [2023-11-06 22:57:55,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-06 22:57:55,660 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 151 transitions. [2023-11-06 22:57:55,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-06 22:57:55,662 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:57:55,662 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:57:55,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:57:55,663 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:57:55,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:57:55,664 INFO L85 PathProgramCache]: Analyzing trace with hash 845366680, now seen corresponding path program 1 times [2023-11-06 22:57:55,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:57:55,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431218256] [2023-11-06 22:57:55,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:57:55,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:57:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:56,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:57:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:56,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-06 22:57:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:56,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:57:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:56,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:57:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:56,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:57:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:56,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:57:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:56,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:57:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:56,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:57:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:56,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:57:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:56,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:57:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:56,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:57:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:56,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 22:57:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:56,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:57:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:56,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:57:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:56,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:57:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:56,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:57:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:56,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:57:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:56,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:57:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:56,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-06 22:57:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:56,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 22:57:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:56,871 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2023-11-06 22:57:56,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:57:56,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431218256] [2023-11-06 22:57:56,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431218256] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:57:56,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:57:56,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:57:56,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631860569] [2023-11-06 22:57:56,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:57:56,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:57:56,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:57:56,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:57:56,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:57:56,876 INFO L87 Difference]: Start difference. First operand 127 states and 151 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 22:57:58,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:57:58,176 INFO L93 Difference]: Finished difference Result 206 states and 248 transitions. [2023-11-06 22:57:58,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:57:58,177 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 121 [2023-11-06 22:57:58,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:57:58,179 INFO L225 Difference]: With dead ends: 206 [2023-11-06 22:57:58,179 INFO L226 Difference]: Without dead ends: 152 [2023-11-06 22:57:58,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:57:58,181 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 91 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:57:58,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 420 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-06 22:57:58,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-06 22:57:58,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 132. [2023-11-06 22:57:58,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.1111111111111112) internal successors, (90), 82 states have internal predecessors, (90), 33 states have call successors, (33), 16 states have call predecessors, (33), 17 states have return successors, (33), 33 states have call predecessors, (33), 32 states have call successors, (33) [2023-11-06 22:57:58,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 156 transitions. [2023-11-06 22:57:58,199 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 156 transitions. Word has length 121 [2023-11-06 22:57:58,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:57:58,200 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 156 transitions. [2023-11-06 22:57:58,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 22:57:58,200 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 156 transitions. [2023-11-06 22:57:58,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-06 22:57:58,203 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:57:58,203 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:57:58,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:57:58,204 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:57:58,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:57:58,204 INFO L85 PathProgramCache]: Analyzing trace with hash 606085033, now seen corresponding path program 1 times [2023-11-06 22:57:58,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:57:58,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860139228] [2023-11-06 22:57:58,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:57:58,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:57:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:59,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:57:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:59,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-06 22:57:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:59,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:57:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:59,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:57:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:59,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:57:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:59,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:57:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:59,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:57:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:59,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:57:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:59,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:57:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:59,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:57:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:59,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:57:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:59,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 22:57:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:59,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:57:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:59,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:57:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:59,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:57:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:59,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:57:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:59,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:57:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:59,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:57:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:59,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:57:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:59,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-06 22:57:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:59,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-06 22:57:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2023-11-06 22:57:59,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:57:59,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860139228] [2023-11-06 22:57:59,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860139228] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:57:59,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:57:59,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:57:59,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385967963] [2023-11-06 22:57:59,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:57:59,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:57:59,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:57:59,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:57:59,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:57:59,476 INFO L87 Difference]: Start difference. First operand 132 states and 156 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-06 22:58:00,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:58:00,853 INFO L93 Difference]: Finished difference Result 212 states and 256 transitions. [2023-11-06 22:58:00,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 22:58:00,854 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) Word has length 127 [2023-11-06 22:58:00,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:58:00,857 INFO L225 Difference]: With dead ends: 212 [2023-11-06 22:58:00,857 INFO L226 Difference]: Without dead ends: 144 [2023-11-06 22:58:00,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2023-11-06 22:58:00,858 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 122 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:58:00,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 404 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-06 22:58:00,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-06 22:58:00,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 125. [2023-11-06 22:58:00,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 77 states have internal predecessors, (83), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-06 22:58:00,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 146 transitions. [2023-11-06 22:58:00,875 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 146 transitions. Word has length 127 [2023-11-06 22:58:00,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:58:00,875 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 146 transitions. [2023-11-06 22:58:00,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-06 22:58:00,876 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 146 transitions. [2023-11-06 22:58:00,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-06 22:58:00,878 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:58:00,879 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:58:00,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:58:00,879 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:58:00,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:58:00,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1368893272, now seen corresponding path program 1 times [2023-11-06 22:58:00,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:58:00,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533678864] [2023-11-06 22:58:00,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:58:00,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:58:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:04,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:58:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:04,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-06 22:58:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:04,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:58:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:05,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:05,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:58:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:05,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:58:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:05,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:58:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:05,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:58:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:05,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:58:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:05,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:58:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:05,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:05,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 22:58:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:05,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:05,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:05,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:58:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:05,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:58:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:05,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:58:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:06,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:06,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:58:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:06,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:06,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:58:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:06,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-06 22:58:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2023-11-06 22:58:06,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:58:06,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533678864] [2023-11-06 22:58:06,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533678864] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:58:06,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:58:06,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2023-11-06 22:58:06,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041421131] [2023-11-06 22:58:06,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:58:06,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-06 22:58:06,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:58:06,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-06 22:58:06,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2023-11-06 22:58:06,518 INFO L87 Difference]: Start difference. First operand 125 states and 146 transitions. Second operand has 22 states, 20 states have (on average 3.2) internal successors, (64), 17 states have internal predecessors, (64), 8 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2023-11-06 22:58:09,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:58:09,787 INFO L93 Difference]: Finished difference Result 190 states and 228 transitions. [2023-11-06 22:58:09,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-06 22:58:09,788 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.2) internal successors, (64), 17 states have internal predecessors, (64), 8 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) Word has length 132 [2023-11-06 22:58:09,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:58:09,790 INFO L225 Difference]: With dead ends: 190 [2023-11-06 22:58:09,790 INFO L226 Difference]: Without dead ends: 144 [2023-11-06 22:58:09,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=172, Invalid=1388, Unknown=0, NotChecked=0, Total=1560 [2023-11-06 22:58:09,793 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 132 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:58:09,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 951 Invalid, 1815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1725 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-06 22:58:09,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-06 22:58:09,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2023-11-06 22:58:09,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 88 states have internal predecessors, (93), 34 states have call successors, (34), 16 states have call predecessors, (34), 18 states have return successors, (35), 33 states have call predecessors, (35), 33 states have call successors, (35) [2023-11-06 22:58:09,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 162 transitions. [2023-11-06 22:58:09,812 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 162 transitions. Word has length 132 [2023-11-06 22:58:09,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:58:09,813 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 162 transitions. [2023-11-06 22:58:09,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.2) internal successors, (64), 17 states have internal predecessors, (64), 8 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2023-11-06 22:58:09,814 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 162 transitions. [2023-11-06 22:58:09,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-06 22:58:09,817 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:58:09,817 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:58:09,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:58:09,817 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:58:09,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:58:09,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1929836520, now seen corresponding path program 1 times [2023-11-06 22:58:09,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:58:09,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495132149] [2023-11-06 22:58:09,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:58:09,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:58:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:10,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:58:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:10,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-06 22:58:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:10,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:58:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:10,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:10,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:58:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:10,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:58:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:10,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:58:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:10,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:58:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:10,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:58:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:10,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:58:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:10,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:10,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:58:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:10,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 22:58:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:10,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:10,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:10,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:58:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:10,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:58:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:10,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:58:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:10,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:10,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:58:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:10,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:10,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 22:58:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:10,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-06 22:58:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:10,683 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2023-11-06 22:58:10,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:58:10,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495132149] [2023-11-06 22:58:10,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495132149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:58:10,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:58:10,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-06 22:58:10,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757419420] [2023-11-06 22:58:10,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:58:10,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:58:10,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:58:10,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:58:10,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:58:10,687 INFO L87 Difference]: Start difference. First operand 138 states and 162 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-06 22:58:12,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:58:12,074 INFO L93 Difference]: Finished difference Result 225 states and 260 transitions. [2023-11-06 22:58:12,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:58:12,075 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) Word has length 138 [2023-11-06 22:58:12,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:58:12,076 INFO L225 Difference]: With dead ends: 225 [2023-11-06 22:58:12,077 INFO L226 Difference]: Without dead ends: 120 [2023-11-06 22:58:12,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:58:12,078 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 105 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:58:12,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 406 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 22:58:12,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-06 22:58:12,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-11-06 22:58:12,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 73 states have (on average 1.082191780821918) internal successors, (79), 74 states have internal predecessors, (79), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-06 22:58:12,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2023-11-06 22:58:12,092 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 138 [2023-11-06 22:58:12,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:58:12,093 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2023-11-06 22:58:12,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-06 22:58:12,094 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2023-11-06 22:58:12,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-06 22:58:12,096 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:58:12,096 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:58:12,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:58:12,097 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:58:12,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:58:12,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1108978750, now seen corresponding path program 1 times [2023-11-06 22:58:12,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:58:12,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458301437] [2023-11-06 22:58:12,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:58:12,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:58:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:12,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:58:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:12,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-06 22:58:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:12,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:58:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:12,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:12,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:58:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:12,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:58:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:12,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:58:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:12,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:58:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:12,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:58:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:12,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:58:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:12,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:12,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 22:58:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:12,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:12,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:12,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:58:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:12,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:58:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:12,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:58:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:12,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:12,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:58:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:12,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:12,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:58:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:13,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-06 22:58:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:13,098 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2023-11-06 22:58:13,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:58:13,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458301437] [2023-11-06 22:58:13,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458301437] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:58:13,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:58:13,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:58:13,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231719436] [2023-11-06 22:58:13,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:58:13,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:58:13,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:58:13,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:58:13,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:58:13,102 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-06 22:58:13,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:58:13,937 INFO L93 Difference]: Finished difference Result 166 states and 195 transitions. [2023-11-06 22:58:13,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:58:13,938 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 133 [2023-11-06 22:58:13,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:58:13,939 INFO L225 Difference]: With dead ends: 166 [2023-11-06 22:58:13,940 INFO L226 Difference]: Without dead ends: 121 [2023-11-06 22:58:13,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:58:13,941 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 171 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:58:13,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 162 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:58:13,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-06 22:58:13,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-11-06 22:58:13,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 75 states have internal predecessors, (80), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-06 22:58:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2023-11-06 22:58:13,964 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 141 transitions. Word has length 133 [2023-11-06 22:58:13,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:58:13,966 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 141 transitions. [2023-11-06 22:58:13,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-06 22:58:13,966 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 141 transitions. [2023-11-06 22:58:13,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-06 22:58:13,968 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:58:13,969 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:58:13,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:58:13,969 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:58:13,970 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:58:13,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1489473318, now seen corresponding path program 1 times [2023-11-06 22:58:13,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:58:13,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714293949] [2023-11-06 22:58:13,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:58:13,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:58:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:19,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:58:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:19,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-06 22:58:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:19,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:58:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:19,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:19,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:58:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:19,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:58:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:19,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:58:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:19,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:58:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:19,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:58:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:19,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:58:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:19,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:19,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 22:58:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:20,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:20,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:20,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:58:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:20,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:58:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:20,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:58:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:20,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:20,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:58:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:20,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:20,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:58:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:20,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:58:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:20,856 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 21 proven. 25 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-11-06 22:58:20,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:58:20,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714293949] [2023-11-06 22:58:20,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714293949] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:58:20,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284269485] [2023-11-06 22:58:20,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:58:20,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:58:20,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:58:20,863 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:58:20,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:58:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:21,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 2901 conjuncts, 128 conjunts are in the unsatisfiable core [2023-11-06 22:58:21,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:58:22,799 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:58:23,046 WARN L861 $PredicateComparison]: unable to prove that (exists ((v_y_6 Int) (v_z_6 Int)) (let ((.cse1 (* 18446744073709551616 v_y_6))) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (let ((.cse0 (+ .cse1 v_z_6 |c_#Ultimate.C_memcpy_dest.offset|))) (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) .cse0 (select (select |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base|) .cse0)))) |c_#memory_int|) (<= (+ v_z_6 1) (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 v_z_6) (<= 0 (+ .cse1 v_z_6))))) is different from true [2023-11-06 22:58:23,983 INFO L322 Elim1Store]: treesize reduction 135, result has 21.1 percent of original size [2023-11-06 22:58:23,983 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 137 [2023-11-06 22:58:24,155 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2023-11-06 22:58:24,169 INFO L322 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2023-11-06 22:58:24,169 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 29 [2023-11-06 22:58:24,258 INFO L322 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2023-11-06 22:58:24,259 INFO L351 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 34 treesize of output 23 [2023-11-06 22:58:24,415 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 70 [2023-11-06 22:58:24,436 INFO L322 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2023-11-06 22:58:24,437 INFO L351 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 100 [2023-11-06 22:58:26,625 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:58:26,626 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 276 [2023-11-06 22:58:26,694 INFO L322 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2023-11-06 22:58:26,696 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 620 treesize of output 564 [2023-11-06 22:58:27,072 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 12 proven. 38 refuted. 0 times theorem prover too weak. 74 trivial. 1 not checked. [2023-11-06 22:58:27,073 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:58:31,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284269485] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:58:31,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:58:31,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 37] total 58 [2023-11-06 22:58:31,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028320317] [2023-11-06 22:58:31,875 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:58:31,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-11-06 22:58:31,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:58:31,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-11-06 22:58:31,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=4120, Unknown=1, NotChecked=128, Total=4422 [2023-11-06 22:58:31,881 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. Second operand has 58 states, 50 states have (on average 2.2) internal successors, (110), 40 states have internal predecessors, (110), 17 states have call successors, (43), 11 states have call predecessors, (43), 14 states have return successors, (40), 23 states have call predecessors, (40), 14 states have call successors, (40) [2023-11-06 22:58:34,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:58:45,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:58:48,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:58:50,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:58:50,515 INFO L93 Difference]: Finished difference Result 174 states and 205 transitions. [2023-11-06 22:58:50,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-06 22:58:50,516 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 50 states have (on average 2.2) internal successors, (110), 40 states have internal predecessors, (110), 17 states have call successors, (43), 11 states have call predecessors, (43), 14 states have return successors, (40), 23 states have call predecessors, (40), 14 states have call successors, (40) Word has length 134 [2023-11-06 22:58:50,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:58:50,518 INFO L225 Difference]: With dead ends: 174 [2023-11-06 22:58:50,518 INFO L226 Difference]: Without dead ends: 124 [2023-11-06 22:58:50,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 146 SyntacticMatches, 4 SemanticMatches, 98 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2018 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=456, Invalid=9249, Unknown=1, NotChecked=194, Total=9900 [2023-11-06 22:58:50,523 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 223 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 3898 mSolverCounterSat, 176 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 4234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 3898 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:58:50,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 1456 Invalid, 4234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 3898 Invalid, 10 Unknown, 150 Unchecked, 14.9s Time] [2023-11-06 22:58:50,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-06 22:58:50,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2023-11-06 22:58:50,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 75 states have (on average 1.08) internal successors, (81), 76 states have internal predecessors, (81), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-06 22:58:50,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2023-11-06 22:58:50,543 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 134 [2023-11-06 22:58:50,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:58:50,544 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2023-11-06 22:58:50,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 50 states have (on average 2.2) internal successors, (110), 40 states have internal predecessors, (110), 17 states have call successors, (43), 11 states have call predecessors, (43), 14 states have return successors, (40), 23 states have call predecessors, (40), 14 states have call successors, (40) [2023-11-06 22:58:50,544 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2023-11-06 22:58:50,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-06 22:58:50,546 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:58:50,547 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:58:50,563 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 22:58:50,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-06 22:58:50,758 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:58:50,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:58:50,758 INFO L85 PathProgramCache]: Analyzing trace with hash 982362820, now seen corresponding path program 2 times [2023-11-06 22:58:50,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:58:50,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670544675] [2023-11-06 22:58:50,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:58:50,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:58:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:55,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 22:58:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:55,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-06 22:58:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:55,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:58:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:55,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:55,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:58:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:55,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:58:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:55,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:58:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:55,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 22:58:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:55,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 22:58:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:55,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 22:58:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:56,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:56,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 22:58:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:56,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:56,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:56,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:58:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:56,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:58:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:56,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:58:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:56,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:56,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:58:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:56,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 22:58:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:56,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:58:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:57,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-06 22:58:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:58:57,280 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 22 proven. 21 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-06 22:58:57,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:58:57,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670544675] [2023-11-06 22:58:57,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670544675] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:58:57,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822682029] [2023-11-06 22:58:57,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:58:57,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:58:57,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:58:57,283 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:58:57,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:58:58,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:58:58,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:58:58,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 3035 conjuncts, 108 conjunts are in the unsatisfiable core [2023-11-06 22:58:58,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:58:59,199 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:58:59,410 WARN L861 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1332_12| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (let ((.cse0 (+ |v_#Ultimate.C_memcpy_#t~loopctr1332_12| |c_#Ultimate.C_memcpy_dest.offset|))) (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) .cse0 (select (select |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base|) .cse0)))) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1332_12| 1) |c_#Ultimate.C_memcpy_#t~loopctr1332|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1332_12|))) is different from true [2023-11-06 22:58:59,437 WARN L861 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1332_12| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1332_13| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (let ((.cse1 (select |c_#memory_int| |c_#Ultimate.C_memcpy_dest.base|)) (.cse2 (+ |v_#Ultimate.C_memcpy_#t~loopctr1332_13| |c_#Ultimate.C_memcpy_dest.offset|))) (store (let ((.cse0 (+ |v_#Ultimate.C_memcpy_#t~loopctr1332_12| |c_#Ultimate.C_memcpy_dest.offset|))) (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) .cse0 (select .cse1 .cse0))) .cse2 (select .cse1 .cse2)))) |c_#memory_int|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1332_12|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1332_12| 1) |v_#Ultimate.C_memcpy_#t~loopctr1332_13|))) is different from true [2023-11-06 22:59:00,506 INFO L322 Elim1Store]: treesize reduction 325, result has 20.1 percent of original size [2023-11-06 22:59:00,507 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 148 treesize of output 202 [2023-11-06 22:59:00,954 INFO L322 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2023-11-06 22:59:00,955 INFO L351 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 45 treesize of output 31 [2023-11-06 22:59:00,979 INFO L322 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2023-11-06 22:59:00,979 INFO L351 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 45 treesize of output 31 [2023-11-06 22:59:01,050 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2023-11-06 22:59:01,062 INFO L322 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-06 22:59:01,062 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 22 [2023-11-06 22:59:01,078 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:59:01,085 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2023-11-06 22:59:01,092 INFO L322 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-06 22:59:01,092 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 22 [2023-11-06 22:59:01,111 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:59:01,111 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2023-11-06 22:59:02,405 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 12 proven. 38 refuted. 0 times theorem prover too weak. 74 trivial. 3 not checked. [2023-11-06 22:59:02,405 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:59:14,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822682029] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:59:14,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:59:14,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 37] total 57 [2023-11-06 22:59:14,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067640625] [2023-11-06 22:59:14,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:59:14,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-11-06 22:59:14,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:59:14,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-11-06 22:59:14,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=3873, Unknown=3, NotChecked=250, Total=4290 [2023-11-06 22:59:14,558 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand has 57 states, 50 states have (on average 2.32) internal successors, (116), 41 states have internal predecessors, (116), 16 states have call successors, (43), 10 states have call predecessors, (43), 14 states have return successors, (41), 22 states have call predecessors, (41), 14 states have call successors, (41) [2023-11-06 22:59:16,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:59:31,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:59:42,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:59:49,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:59:57,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:59:57,068 INFO L93 Difference]: Finished difference Result 175 states and 206 transitions. [2023-11-06 22:59:57,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-06 22:59:57,069 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 50 states have (on average 2.32) internal successors, (116), 41 states have internal predecessors, (116), 16 states have call successors, (43), 10 states have call predecessors, (43), 14 states have return successors, (41), 22 states have call predecessors, (41), 14 states have call successors, (41) Word has length 135 [2023-11-06 22:59:57,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:59:57,071 INFO L225 Difference]: With dead ends: 175 [2023-11-06 22:59:57,071 INFO L226 Difference]: Without dead ends: 125 [2023-11-06 22:59:57,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1556 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=459, Invalid=9245, Unknown=6, NotChecked=390, Total=10100 [2023-11-06 22:59:57,076 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 259 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 4063 mSolverCounterSat, 208 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 4584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 4063 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 302 IncrementalHoareTripleChecker+Unchecked, 34.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:59:57,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1540 Invalid, 4584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 4063 Invalid, 11 Unknown, 302 Unchecked, 34.1s Time] [2023-11-06 22:59:57,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-06 22:59:57,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2023-11-06 22:59:57,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 77 states have internal predecessors, (82), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-06 22:59:57,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2023-11-06 22:59:57,096 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 135 [2023-11-06 22:59:57,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:59:57,097 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2023-11-06 22:59:57,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 50 states have (on average 2.32) internal successors, (116), 41 states have internal predecessors, (116), 16 states have call successors, (43), 10 states have call predecessors, (43), 14 states have return successors, (41), 22 states have call predecessors, (41), 14 states have call successors, (41) [2023-11-06 22:59:57,097 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2023-11-06 22:59:57,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-06 22:59:57,099 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:59:57,099 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:59:57,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:59:57,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-06 22:59:57,311 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:59:57,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:59:57,312 INFO L85 PathProgramCache]: Analyzing trace with hash 299871770, now seen corresponding path program 3 times [2023-11-06 22:59:57,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:59:57,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917086665] [2023-11-06 22:59:57,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:59:57,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:59:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:00,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-06 23:00:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:00,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-06 23:00:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:00,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 23:00:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:00,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:00:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:00,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 23:00:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:00,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 23:00:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:00,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 23:00:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:00,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-06 23:00:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:00,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-06 23:00:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:00,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-06 23:00:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:00,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:00:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:00,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 23:00:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:00,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:00:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:00,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:00:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:00,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:00:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:00,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:00:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:00,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 23:00:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:00,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:00:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:00,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 23:00:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:01,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:00:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:01,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 23:00:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:01,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-06 23:00:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:01,558 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2023-11-06 23:00:01,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:01,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917086665] [2023-11-06 23:00:01,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917086665] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:01,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005764495] [2023-11-06 23:00:01,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 23:00:01,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:01,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:01,560 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:00:01,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f239dd5f-be90-4463-9093-7a4b7b1c95eb/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 23:00:04,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-06 23:00:04,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:00:04,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 2939 conjuncts, 130 conjunts are in the unsatisfiable core [2023-11-06 23:00:04,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:05,023 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 23:00:05,198 WARN L861 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1332_23| Int) (v_ArrVal_1972 Int)) (and (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1332_23|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1332_23| 1) |c_#Ultimate.C_memcpy_#t~loopctr1332|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (let ((.cse0 (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|)) (.cse1 (+ |v_#Ultimate.C_memcpy_#t~loopctr1332_23| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse1 (let ((.cse2 (+ |c_#Ultimate.C_memcpy_src.offset| |v_#Ultimate.C_memcpy_#t~loopctr1332_23|))) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store .cse0 .cse1 (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store .cse0 .cse1 (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store .cse0 .cse1 (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store .cse0 .cse1 (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store .cse0 .cse1 v_ArrVal_1972)) |c_#Ultimate.C_memcpy_src.base|) .cse2))) |c_#Ultimate.C_memcpy_src.base|) .cse2))) |c_#Ultimate.C_memcpy_src.base|) .cse2))) |c_#Ultimate.C_memcpy_src.base|) .cse2))) |c_#Ultimate.C_memcpy_src.base|) .cse2)))))))) is different from true [2023-11-06 23:00:05,257 WARN L861 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1332_23| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1332_24| Int) (v_ArrVal_1972 Int) (|#Ultimate.C_memcpy_#t~mem1338| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1332_24| 1) |c_#Ultimate.C_memcpy_#t~loopctr1332|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1332_23|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1332_23| 1) |v_#Ultimate.C_memcpy_#t~loopctr1332_24|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (let ((.cse0 (let ((.cse3 (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|)) (.cse4 (+ |v_#Ultimate.C_memcpy_#t~loopctr1332_23| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse3 .cse4 (let ((.cse5 (+ |c_#Ultimate.C_memcpy_src.offset| |v_#Ultimate.C_memcpy_#t~loopctr1332_23|))) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store .cse3 .cse4 (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store .cse3 .cse4 (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store .cse3 .cse4 (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store .cse3 .cse4 (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store .cse3 .cse4 v_ArrVal_1972)) |c_#Ultimate.C_memcpy_src.base|) .cse5))) |c_#Ultimate.C_memcpy_src.base|) .cse5))) |c_#Ultimate.C_memcpy_src.base|) .cse5))) |c_#Ultimate.C_memcpy_src.base|) .cse5))) |c_#Ultimate.C_memcpy_src.base|) .cse5))))) (.cse1 (+ |v_#Ultimate.C_memcpy_#t~loopctr1332_24| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse1 (let ((.cse2 (+ |c_#Ultimate.C_memcpy_src.offset| |v_#Ultimate.C_memcpy_#t~loopctr1332_24|))) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store .cse0 .cse1 (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store .cse0 .cse1 |#Ultimate.C_memcpy_#t~mem1338|)) |c_#Ultimate.C_memcpy_src.base|) .cse2))) |c_#Ultimate.C_memcpy_src.base|) .cse2)))))))) is different from true [2023-11-06 23:00:05,363 WARN L861 $PredicateComparison]: unable to prove that (exists ((|#Ultimate.C_memcpy_src.base| Int) (|#Ultimate.C_memcpy_src.offset| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1332_23| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1332_24| Int) (v_ArrVal_1972 Int) (|#Ultimate.C_memcpy_#t~mem1338| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1332_25| Int) (v_ArrVal_1992 (Array Int Int))) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (let ((.cse0 (let ((.cse3 (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|)) (.cse4 (+ |v_#Ultimate.C_memcpy_#t~loopctr1332_23| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse3 .cse4 (let ((.cse5 (+ |v_#Ultimate.C_memcpy_#t~loopctr1332_23| |#Ultimate.C_memcpy_src.offset|))) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store .cse3 .cse4 (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store .cse3 .cse4 (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store .cse3 .cse4 (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store .cse3 .cse4 (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store .cse3 .cse4 v_ArrVal_1972)) |#Ultimate.C_memcpy_src.base|) .cse5))) |#Ultimate.C_memcpy_src.base|) .cse5))) |#Ultimate.C_memcpy_src.base|) .cse5))) |#Ultimate.C_memcpy_src.base|) .cse5))) |#Ultimate.C_memcpy_src.base|) .cse5))))) (.cse1 (+ |v_#Ultimate.C_memcpy_#t~loopctr1332_24| |c_#Ultimate.C_memcpy_dest.offset|))) (store .cse0 .cse1 (let ((.cse2 (+ |v_#Ultimate.C_memcpy_#t~loopctr1332_24| |#Ultimate.C_memcpy_src.offset|))) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store .cse0 .cse1 (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store .cse0 .cse1 |#Ultimate.C_memcpy_#t~mem1338|)) |#Ultimate.C_memcpy_src.base|) .cse2))) |#Ultimate.C_memcpy_src.base|) .cse2)))) (+ |v_#Ultimate.C_memcpy_#t~loopctr1332_25| |c_#Ultimate.C_memcpy_dest.offset|) (select (select (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| v_ArrVal_1992) |#Ultimate.C_memcpy_src.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1332_25| |#Ultimate.C_memcpy_src.offset|)))) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1332_24| 1) |v_#Ultimate.C_memcpy_#t~loopctr1332_25|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1332_23|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1332_23| 1) |v_#Ultimate.C_memcpy_#t~loopctr1332_24|))) is different from true [2023-11-06 23:00:06,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:06,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:06,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:06,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:06,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:06,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:06,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:06,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:06,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:13,682 WARN L293 SmtUtils]: Spent 6.84s on a formula simplification. DAG size of input: 549 DAG size of output: 221 (called from [L 319] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-06 23:00:13,683 INFO L322 Elim1Store]: treesize reduction 5600, result has 23.8 percent of original size [2023-11-06 23:00:13,685 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 12 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 16 new quantified variables, introduced 54 case distinctions, treesize of input 14822 treesize of output 7880 [2023-11-06 23:00:15,017 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 55 [2023-11-06 23:00:15,878 INFO L217 Elim1Store]: Index analysis took 299 ms [2023-11-06 23:00:16,092 INFO L322 Elim1Store]: treesize reduction 231, result has 8.3 percent of original size [2023-11-06 23:00:16,093 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 11 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 12 case distinctions, treesize of input 924 treesize of output 1150 [2023-11-06 23:00:52,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:52,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:52,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:52,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:52,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:52,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:52,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:52,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:52,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:52,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:52,864 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2023-11-06 23:00:54,319 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 23:00:54,349 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 23:00:54,379 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 23:00:54,605 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 23:00:54,624 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 23:00:55,209 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 23:00:55,247 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 23:00:55,276 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 23:00:55,424 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 23:00:55,453 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 23:00:55,483 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 23:00:55,594 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 23:00:55,624 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 23:00:55,656 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 23:00:56,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:56,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:56,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:56,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:56,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:56,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:56,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:56,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:56,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:56,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:00:56,353 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 34 [2023-11-06 23:00:56,447 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 23:00:58,268 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 23:00:58,297 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 23:00:58,325 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 23:00:58,435 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 23:00:58,464 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 23:00:58,492 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 23:00:59,149 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 23:00:59,177 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 23:00:59,207 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 23:01:16,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:16,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:16,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:16,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:16,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:16,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:16,713 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2023-11-06 23:01:16,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:16,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:16,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:16,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:16,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:16,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:01:16,806 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 34