./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f57bc64edf303a057c8eafb48480d4e5b764bd411481261d53eb2a101eb82ae8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:49:30,571 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:49:30,647 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-29 05:49:30,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:49:30,652 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:49:30,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:49:30,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:49:30,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:49:30,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:49:30,678 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:49:30,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:49:30,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:49:30,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:49:30,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:49:30,681 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:49:30,682 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:49:30,682 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:49:30,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:49:30,683 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:49:30,684 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:49:30,684 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:49:30,687 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:49:30,687 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:49:30,688 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:49:30,688 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:49:30,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:49:30,689 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:49:30,690 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:49:30,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:49:30,691 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:49:30,691 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:49:30,691 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:49:30,692 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:49:30,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:49:30,692 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:49:30,692 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:49:30,692 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:49:30,693 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:49:30,693 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:49:30,693 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_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f57bc64edf303a057c8eafb48480d4e5b764bd411481261d53eb2a101eb82ae8 [2023-11-29 05:49:30,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:49:30,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:49:30,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:49:30,934 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:49:30,935 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:49:30,936 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i [2023-11-29 05:49:33,611 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:49:33,954 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:49:33,955 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i [2023-11-29 05:49:33,983 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/data/f8aad6f9d/c595729ee74546eba780e9723a259dcf/FLAG966a737c8 [2023-11-29 05:49:33,996 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/data/f8aad6f9d/c595729ee74546eba780e9723a259dcf [2023-11-29 05:49:33,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:49:34,000 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:49:34,001 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:49:34,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:49:34,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:49:34,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:49:33" (1/1) ... [2023-11-29 05:49:34,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59c40410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:49:34, skipping insertion in model container [2023-11-29 05:49:34,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:49:33" (1/1) ... [2023-11-29 05:49:34,118 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:49:34,323 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_a2caee67-a04a-43c7-8eae-0ab5458bba3c/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i[4494,4507] [2023-11-29 05:49:34,330 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_a2caee67-a04a-43c7-8eae-0ab5458bba3c/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i[4554,4567] [2023-11-29 05:49:35,005 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:49:35,005 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:49:35,006 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:49:35,007 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:49:35,008 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:49:35,024 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:49:35,024 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:49:35,026 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:49:35,027 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:49:35,029 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:49:35,030 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:49:35,031 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:49:35,031 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:49:35,353 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-29 05:49:35,354 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-29 05:49:35,356 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-29 05:49:35,357 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-29 05:49:35,359 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-29 05:49:35,359 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-29 05:49:35,360 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-29 05:49:35,361 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-29 05:49:35,362 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-29 05:49:35,362 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-29 05:49:35,532 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:49:35,550 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:49:35,564 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_a2caee67-a04a-43c7-8eae-0ab5458bba3c/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i[4494,4507] [2023-11-29 05:49:35,565 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_a2caee67-a04a-43c7-8eae-0ab5458bba3c/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i[4554,4567] [2023-11-29 05:49:35,609 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:49:35,609 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:49:35,610 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:49:35,610 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:49:35,611 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:49:35,621 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:49:35,622 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:49:35,623 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:49:35,623 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:49:35,624 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:49:35,625 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:49:35,626 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:49:35,626 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:49:35,665 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-29 05:49:35,666 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-29 05:49:35,667 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-29 05:49:35,668 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-29 05:49:35,669 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-29 05:49:35,669 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-29 05:49:35,670 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-29 05:49:35,670 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-29 05:49:35,671 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-29 05:49:35,671 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-29 05:49:35,710 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:49:36,075 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:49:36,076 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:49:36,076 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:49:36,076 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:49:36,076 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:49:36,076 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:49:36,076 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:49:36,077 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:49:36,077 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:49:36,077 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:49:36,077 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:49:36,077 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:49:36,077 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:49:36,077 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:49:36,077 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:49:36,078 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:49:36,086 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:49:36,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:49:36 WrapperNode [2023-11-29 05:49:36,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:49:36,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:49:36,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:49:36,088 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:49:36,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:49:36" (1/1) ... [2023-11-29 05:49:36,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:49:36" (1/1) ... [2023-11-29 05:49:36,197 INFO L138 Inliner]: procedures = 678, calls = 1045, calls flagged for inlining = 50, calls inlined = 5, statements flattened = 133 [2023-11-29 05:49:36,197 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:49:36,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:49:36,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:49:36,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:49:36,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:49:36" (1/1) ... [2023-11-29 05:49:36,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:49:36" (1/1) ... [2023-11-29 05:49:36,214 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:49:36" (1/1) ... [2023-11-29 05:49:36,240 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 5, 20]. 74 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2023-11-29 05:49:36,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:49:36" (1/1) ... [2023-11-29 05:49:36,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:49:36" (1/1) ... [2023-11-29 05:49:36,256 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:49:36" (1/1) ... [2023-11-29 05:49:36,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:49:36" (1/1) ... [2023-11-29 05:49:36,264 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:49:36" (1/1) ... [2023-11-29 05:49:36,267 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:49:36" (1/1) ... [2023-11-29 05:49:36,273 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:49:36,274 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:49:36,274 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:49:36,274 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:49:36,275 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:49:36" (1/1) ... [2023-11-29 05:49:36,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:49:36,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:49:36,306 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:49:36,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:49:36,341 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_back [2023-11-29 05:49:36,341 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_back [2023-11-29 05:49:36,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:49:36,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 05:49:36,341 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 05:49:36,341 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-29 05:49:36,341 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-29 05:49:36,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 05:49:36,342 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-29 05:49:36,342 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-29 05:49:36,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:49:36,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 05:49:36,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 05:49:36,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 05:49:36,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:49:36,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:49:36,343 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2023-11-29 05:49:36,343 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2023-11-29 05:49:36,343 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 05:49:36,343 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 05:49:36,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:49:36,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 05:49:36,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 05:49:36,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 05:49:36,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 05:49:36,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 05:49:36,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 05:49:36,344 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-29 05:49:36,344 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-29 05:49:36,344 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-29 05:49:36,344 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-29 05:49:36,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:49:36,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:49:36,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 05:49:36,561 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:49:36,563 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:49:36,787 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:49:36,823 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:49:36,823 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 05:49:36,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:49:36 BoogieIcfgContainer [2023-11-29 05:49:36,824 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:49:36,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:49:36,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:49:36,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:49:36,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:49:33" (1/3) ... [2023-11-29 05:49:36,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e0342d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:49:36, skipping insertion in model container [2023-11-29 05:49:36,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:49:36" (2/3) ... [2023-11-29 05:49:36,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e0342d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:49:36, skipping insertion in model container [2023-11-29 05:49:36,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:49:36" (3/3) ... [2023-11-29 05:49:36,832 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_back_harness.i [2023-11-29 05:49:36,845 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:49:36,846 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:49:36,886 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:49:36,892 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@77b68d9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:49:36,892 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:49:36,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 54 states have internal predecessors, (72), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 05:49:36,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-29 05:49:36,908 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:49:36,909 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:49:36,909 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:49:36,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:49:36,915 INFO L85 PathProgramCache]: Analyzing trace with hash 24712143, now seen corresponding path program 1 times [2023-11-29 05:49:36,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:49:36,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716425024] [2023-11-29 05:49:36,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:49:36,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:49:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:37,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:49:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:37,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:49:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:37,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:49:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:37,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:49:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:37,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 05:49:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:37,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:49:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:37,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:49:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:37,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:49:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:37,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:49:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:37,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 05:49:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:37,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:49:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:37,436 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-29 05:49:37,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:49:37,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716425024] [2023-11-29 05:49:37,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716425024] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:49:37,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:49:37,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:49:37,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531109520] [2023-11-29 05:49:37,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:49:37,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:49:37,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:49:37,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:49:37,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:49:37,471 INFO L87 Difference]: Start difference. First operand has 87 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 54 states have internal predecessors, (72), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 05:49:37,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:49:37,531 INFO L93 Difference]: Finished difference Result 168 states and 251 transitions. [2023-11-29 05:49:37,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:49:37,534 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 79 [2023-11-29 05:49:37,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:49:37,542 INFO L225 Difference]: With dead ends: 168 [2023-11-29 05:49:37,542 INFO L226 Difference]: Without dead ends: 85 [2023-11-29 05:49:37,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:49:37,549 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:49:37,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:49:37,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-29 05:49:37,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-11-29 05:49:37,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 53 states have internal predecessors, (67), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 05:49:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 114 transitions. [2023-11-29 05:49:37,593 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 114 transitions. Word has length 79 [2023-11-29 05:49:37,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:49:37,593 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 114 transitions. [2023-11-29 05:49:37,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 05:49:37,594 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 114 transitions. [2023-11-29 05:49:37,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-29 05:49:37,598 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:49:37,598 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:49:37,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:49:37,599 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:49:37,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:49:37,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1865722609, now seen corresponding path program 1 times [2023-11-29 05:49:37,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:49:37,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187684109] [2023-11-29 05:49:37,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:49:37,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:49:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:37,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:49:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:37,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:49:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:37,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:49:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:37,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:49:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:37,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 05:49:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:37,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:49:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:38,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:49:38,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:38,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:49:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:38,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:49:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:38,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 05:49:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:38,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:49:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:38,162 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-11-29 05:49:38,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:49:38,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187684109] [2023-11-29 05:49:38,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187684109] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:49:38,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984194500] [2023-11-29 05:49:38,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:49:38,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:49:38,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:49:38,167 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:49:38,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:49:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:38,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-29 05:49:38,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:49:38,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-29 05:49:38,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-29 05:49:38,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:49:38,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 35 [2023-11-29 05:49:38,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2023-11-29 05:49:41,259 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-29 05:49:41,260 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:49:41,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984194500] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:49:41,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:49:41,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2023-11-29 05:49:41,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349445236] [2023-11-29 05:49:41,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:49:41,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:49:41,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:49:41,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:49:41,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-11-29 05:49:41,264 INFO L87 Difference]: Start difference. First operand 85 states and 114 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-29 05:49:42,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:49:42,249 INFO L93 Difference]: Finished difference Result 236 states and 320 transitions. [2023-11-29 05:49:42,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:49:42,249 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 79 [2023-11-29 05:49:42,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:49:42,251 INFO L225 Difference]: With dead ends: 236 [2023-11-29 05:49:42,252 INFO L226 Difference]: Without dead ends: 164 [2023-11-29 05:49:42,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 80 SyntacticMatches, 12 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2023-11-29 05:49:42,253 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 82 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:49:42,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 539 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 05:49:42,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-11-29 05:49:42,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2023-11-29 05:49:42,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 100 states have (on average 1.3) internal successors, (130), 102 states have internal predecessors, (130), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 05:49:42,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 220 transitions. [2023-11-29 05:49:42,276 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 220 transitions. Word has length 79 [2023-11-29 05:49:42,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:49:42,276 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 220 transitions. [2023-11-29 05:49:42,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-29 05:49:42,277 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 220 transitions. [2023-11-29 05:49:42,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-29 05:49:42,278 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:49:42,279 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:49:42,285 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:49:42,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:49:42,479 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:49:42,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:49:42,480 INFO L85 PathProgramCache]: Analyzing trace with hash 2043544783, now seen corresponding path program 1 times [2023-11-29 05:49:42,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:49:42,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455581101] [2023-11-29 05:49:42,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:49:42,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:49:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:42,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:49:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:42,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:49:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:42,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:49:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:42,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:49:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:42,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 05:49:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:42,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:49:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:42,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:49:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:42,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:49:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:42,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:49:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:42,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 05:49:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:42,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:49:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:42,845 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-11-29 05:49:42,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:49:42,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455581101] [2023-11-29 05:49:42,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455581101] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:49:42,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012877153] [2023-11-29 05:49:42,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:49:42,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:49:42,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:49:42,848 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:49:42,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:49:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:49:43,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-29 05:49:43,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:49:43,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-29 05:49:43,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:49:43,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-29 05:49:44,013 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-11-29 05:49:44,013 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:49:44,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012877153] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:49:44,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:49:44,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2023-11-29 05:49:44,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136393427] [2023-11-29 05:49:44,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:49:44,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 05:49:44,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:49:44,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 05:49:44,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:49:44,016 INFO L87 Difference]: Start difference. First operand 162 states and 220 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-29 05:49:48,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:49:52,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:49:56,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:50:00,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:50:04,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:50:04,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:50:04,906 INFO L93 Difference]: Finished difference Result 248 states and 338 transitions. [2023-11-29 05:50:04,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:50:04,907 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 79 [2023-11-29 05:50:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:50:04,910 INFO L225 Difference]: With dead ends: 248 [2023-11-29 05:50:04,910 INFO L226 Difference]: Without dead ends: 167 [2023-11-29 05:50:04,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 79 SyntacticMatches, 12 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2023-11-29 05:50:04,912 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 105 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 34 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:50:04,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 565 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 531 Invalid, 5 Unknown, 0 Unchecked, 20.8s Time] [2023-11-29 05:50:04,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-11-29 05:50:04,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2023-11-29 05:50:04,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 104 states have internal predecessors, (132), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 05:50:04,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 222 transitions. [2023-11-29 05:50:04,940 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 222 transitions. Word has length 79 [2023-11-29 05:50:04,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:50:04,941 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 222 transitions. [2023-11-29 05:50:04,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-29 05:50:04,941 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 222 transitions. [2023-11-29 05:50:04,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-29 05:50:04,943 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:50:04,943 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:04,949 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:50:05,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:50:05,144 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:50:05,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:05,145 INFO L85 PathProgramCache]: Analyzing trace with hash 753124495, now seen corresponding path program 1 times [2023-11-29 05:50:05,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:05,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156971584] [2023-11-29 05:50:05,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:05,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:05,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:05,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:50:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:05,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:50:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:05,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:05,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 05:50:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:05,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:50:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:05,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:50:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:05,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:50:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:05,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:05,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 05:50:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:05,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:50:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:05,459 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-11-29 05:50:05,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:05,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156971584] [2023-11-29 05:50:05,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156971584] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:50:05,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193142621] [2023-11-29 05:50:05,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:05,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:50:05,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:50:05,461 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:50:05,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 05:50:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:05,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-29 05:50:05,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:50:05,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-29 05:50:05,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-29 05:50:05,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:50:05,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:50:05,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:50:05,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2023-11-29 05:50:05,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:50:05,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:50:05,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:50:05,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2023-11-29 05:50:07,829 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:50:07,829 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:50:07,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193142621] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:07,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:50:07,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2023-11-29 05:50:07,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83466303] [2023-11-29 05:50:07,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:07,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 05:50:07,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:07,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 05:50:07,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:50:07,832 INFO L87 Difference]: Start difference. First operand 164 states and 222 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-29 05:50:09,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:50:09,029 INFO L93 Difference]: Finished difference Result 257 states and 348 transitions. [2023-11-29 05:50:09,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 05:50:09,029 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 79 [2023-11-29 05:50:09,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:50:09,032 INFO L225 Difference]: With dead ends: 257 [2023-11-29 05:50:09,032 INFO L226 Difference]: Without dead ends: 171 [2023-11-29 05:50:09,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 79 SyntacticMatches, 12 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2023-11-29 05:50:09,033 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 124 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:50:09,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 622 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 05:50:09,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-11-29 05:50:09,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 166. [2023-11-29 05:50:09,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 104 states have (on average 1.2884615384615385) internal successors, (134), 106 states have internal predecessors, (134), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 05:50:09,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 224 transitions. [2023-11-29 05:50:09,062 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 224 transitions. Word has length 79 [2023-11-29 05:50:09,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:50:09,062 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 224 transitions. [2023-11-29 05:50:09,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-29 05:50:09,062 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 224 transitions. [2023-11-29 05:50:09,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-29 05:50:09,064 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:50:09,064 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:09,071 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 05:50:09,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:50:09,266 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:50:09,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:09,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1904776271, now seen corresponding path program 1 times [2023-11-29 05:50:09,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:09,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061370167] [2023-11-29 05:50:09,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:09,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:09,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:09,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:50:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:09,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:50:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:09,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:09,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 05:50:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:09,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:50:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:09,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:50:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:09,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:50:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:09,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:09,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 05:50:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:09,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:50:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:09,928 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-29 05:50:09,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:09,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061370167] [2023-11-29 05:50:09,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061370167] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:50:09,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081851500] [2023-11-29 05:50:09,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:09,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:50:09,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:50:09,929 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:50:09,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 05:50:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:10,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-29 05:50:10,099 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:50:10,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-29 05:50:10,638 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 05:50:10,638 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:50:10,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081851500] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:10,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:50:10,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11] total 21 [2023-11-29 05:50:10,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966106957] [2023-11-29 05:50:10,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:10,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 05:50:10,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:10,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 05:50:10,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2023-11-29 05:50:10,640 INFO L87 Difference]: Start difference. First operand 166 states and 224 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2023-11-29 05:50:11,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:50:11,381 INFO L93 Difference]: Finished difference Result 267 states and 359 transitions. [2023-11-29 05:50:11,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:50:11,382 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 79 [2023-11-29 05:50:11,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:50:11,383 INFO L225 Difference]: With dead ends: 267 [2023-11-29 05:50:11,383 INFO L226 Difference]: Without dead ends: 175 [2023-11-29 05:50:11,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2023-11-29 05:50:11,385 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 155 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:50:11,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 601 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 05:50:11,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-11-29 05:50:11,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2023-11-29 05:50:11,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 106 states have (on average 1.2830188679245282) internal successors, (136), 108 states have internal predecessors, (136), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 05:50:11,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 226 transitions. [2023-11-29 05:50:11,401 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 226 transitions. Word has length 79 [2023-11-29 05:50:11,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:50:11,402 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 226 transitions. [2023-11-29 05:50:11,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 5 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2023-11-29 05:50:11,402 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 226 transitions. [2023-11-29 05:50:11,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-29 05:50:11,403 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:50:11,403 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:11,408 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 05:50:11,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:50:11,604 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:50:11,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:11,604 INFO L85 PathProgramCache]: Analyzing trace with hash 540570639, now seen corresponding path program 1 times [2023-11-29 05:50:11,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:11,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776396428] [2023-11-29 05:50:11,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:11,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:11,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:11,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:50:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:11,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:50:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:11,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:11,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 05:50:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:11,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:50:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:11,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:50:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:11,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:50:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:11,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:11,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 05:50:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:11,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:50:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:11,874 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-29 05:50:11,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:11,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776396428] [2023-11-29 05:50:11,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776396428] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:50:11,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632540568] [2023-11-29 05:50:11,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:11,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:50:11,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:50:11,876 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:50:11,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 05:50:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:12,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 05:50:12,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:50:12,129 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 05:50:12,130 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:50:12,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632540568] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:12,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:50:12,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2023-11-29 05:50:12,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785990362] [2023-11-29 05:50:12,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:12,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:50:12,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:12,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:50:12,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:50:12,132 INFO L87 Difference]: Start difference. First operand 168 states and 226 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 05:50:12,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:50:12,258 INFO L93 Difference]: Finished difference Result 343 states and 468 transitions. [2023-11-29 05:50:12,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:50:12,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 79 [2023-11-29 05:50:12,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:50:12,261 INFO L225 Difference]: With dead ends: 343 [2023-11-29 05:50:12,261 INFO L226 Difference]: Without dead ends: 161 [2023-11-29 05:50:12,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:50:12,263 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 30 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:50:12,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 628 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:50:12,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-11-29 05:50:12,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2023-11-29 05:50:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 99 states have (on average 1.2424242424242424) internal successors, (123), 101 states have internal predecessors, (123), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 05:50:12,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 213 transitions. [2023-11-29 05:50:12,288 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 213 transitions. Word has length 79 [2023-11-29 05:50:12,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:50:12,289 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 213 transitions. [2023-11-29 05:50:12,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 05:50:12,289 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 213 transitions. [2023-11-29 05:50:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-29 05:50:12,291 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:50:12,291 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:12,297 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 05:50:12,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:50:12,491 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:50:12,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:12,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1937679719, now seen corresponding path program 1 times [2023-11-29 05:50:12,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:12,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750358196] [2023-11-29 05:50:12,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:12,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:12,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:12,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:50:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:12,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:50:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:12,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:12,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 05:50:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:12,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 05:50:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:12,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 05:50:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:12,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 05:50:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:12,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:12,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 05:50:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:12,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 05:50:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:12,736 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-11-29 05:50:12,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:12,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750358196] [2023-11-29 05:50:12,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750358196] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:50:12,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205354735] [2023-11-29 05:50:12,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:12,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:50:12,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:50:12,738 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:50:12,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 05:50:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:12,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-29 05:50:12,964 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:50:12,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-29 05:50:13,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-29 05:50:13,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-29 05:50:13,165 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 05:50:13,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 05:50:13,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2023-11-29 05:50:13,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-29 05:50:13,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2023-11-29 05:50:13,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-29 05:50:13,320 INFO L349 Elim1Store]: treesize reduction 175, result has 11.2 percent of original size [2023-11-29 05:50:13,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 157 treesize of output 81 [2023-11-29 05:50:13,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 36 [2023-11-29 05:50:14,456 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 05:50:14,456 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:50:15,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:50:15,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 98 [2023-11-29 05:50:15,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:50:15,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2023-11-29 05:50:15,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2023-11-29 05:50:15,629 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:50:15,630 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:50:15,697 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-29 05:50:15,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 242 treesize of output 228 [2023-11-29 05:50:15,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:50:15,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 147 [2023-11-29 05:50:15,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:50:15,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 136 [2023-11-29 05:50:15,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-29 05:50:15,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:50:15,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 141 [2023-11-29 05:50:16,193 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:50:16,244 INFO L349 Elim1Store]: treesize reduction 106, result has 32.5 percent of original size [2023-11-29 05:50:16,244 INFO L378 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 4 case distinctions, treesize of input 54 treesize of output 80 [2023-11-29 05:50:16,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:50:16,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 99 [2023-11-29 05:50:16,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2023-11-29 05:50:16,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-29 05:50:16,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:50:16,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 67 [2023-11-29 05:50:17,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205354735] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:50:17,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:50:17,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12] total 17 [2023-11-29 05:50:17,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004005427] [2023-11-29 05:50:17,357 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:50:17,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 05:50:17,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:17,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 05:50:17,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=574, Unknown=1, NotChecked=0, Total=650 [2023-11-29 05:50:17,359 INFO L87 Difference]: Start difference. First operand 161 states and 213 transitions. Second operand has 17 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 7 states have call successors, (24), 5 states have call predecessors, (24), 7 states have return successors, (21), 6 states have call predecessors, (21), 7 states have call successors, (21) [2023-11-29 05:50:19,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:50:19,227 INFO L93 Difference]: Finished difference Result 318 states and 430 transitions. [2023-11-29 05:50:19,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 05:50:19,228 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 7 states have call successors, (24), 5 states have call predecessors, (24), 7 states have return successors, (21), 6 states have call predecessors, (21), 7 states have call successors, (21) Word has length 80 [2023-11-29 05:50:19,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:50:19,231 INFO L225 Difference]: With dead ends: 318 [2023-11-29 05:50:19,231 INFO L226 Difference]: Without dead ends: 244 [2023-11-29 05:50:19,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 150 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=201, Invalid=1520, Unknown=1, NotChecked=0, Total=1722 [2023-11-29 05:50:19,232 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 190 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:50:19,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1162 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 05:50:19,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2023-11-29 05:50:19,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2023-11-29 05:50:19,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 149 states have (on average 1.25503355704698) internal successors, (187), 154 states have internal predecessors, (187), 68 states have call successors, (68), 22 states have call predecessors, (68), 24 states have return successors, (69), 65 states have call predecessors, (69), 65 states have call successors, (69) [2023-11-29 05:50:19,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 324 transitions. [2023-11-29 05:50:19,260 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 324 transitions. Word has length 80 [2023-11-29 05:50:19,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:50:19,260 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 324 transitions. [2023-11-29 05:50:19,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 7 states have call successors, (24), 5 states have call predecessors, (24), 7 states have return successors, (21), 6 states have call predecessors, (21), 7 states have call successors, (21) [2023-11-29 05:50:19,261 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 324 transitions. [2023-11-29 05:50:19,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-29 05:50:19,262 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:50:19,262 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:19,269 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 05:50:19,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:50:19,463 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:50:19,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:19,463 INFO L85 PathProgramCache]: Analyzing trace with hash 696470889, now seen corresponding path program 1 times [2023-11-29 05:50:19,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:19,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433419263] [2023-11-29 05:50:19,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:19,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:19,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:19,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:50:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:19,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:50:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:19,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:19,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 05:50:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:19,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 05:50:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:19,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 05:50:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:19,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 05:50:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:19,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:19,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 05:50:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:19,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 05:50:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:19,748 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-29 05:50:19,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:19,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433419263] [2023-11-29 05:50:19,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433419263] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:50:19,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296178861] [2023-11-29 05:50:19,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:19,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:50:19,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:50:19,750 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:50:19,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 05:50:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:19,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 05:50:19,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:50:20,036 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-29 05:50:20,036 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:50:20,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296178861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:20,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:50:20,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2023-11-29 05:50:20,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925720139] [2023-11-29 05:50:20,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:20,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:50:20,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:20,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:50:20,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:50:20,038 INFO L87 Difference]: Start difference. First operand 242 states and 324 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 05:50:20,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:50:20,253 INFO L93 Difference]: Finished difference Result 462 states and 619 transitions. [2023-11-29 05:50:20,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:50:20,253 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 82 [2023-11-29 05:50:20,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:50:20,256 INFO L225 Difference]: With dead ends: 462 [2023-11-29 05:50:20,256 INFO L226 Difference]: Without dead ends: 242 [2023-11-29 05:50:20,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2023-11-29 05:50:20,258 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 42 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:50:20,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 555 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:50:20,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-11-29 05:50:20,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2023-11-29 05:50:20,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 149 states have (on average 1.2348993288590604) internal successors, (184), 154 states have internal predecessors, (184), 68 states have call successors, (68), 22 states have call predecessors, (68), 24 states have return successors, (69), 65 states have call predecessors, (69), 65 states have call successors, (69) [2023-11-29 05:50:20,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 321 transitions. [2023-11-29 05:50:20,297 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 321 transitions. Word has length 82 [2023-11-29 05:50:20,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:50:20,297 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 321 transitions. [2023-11-29 05:50:20,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 05:50:20,298 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 321 transitions. [2023-11-29 05:50:20,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-29 05:50:20,299 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:50:20,300 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:20,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 05:50:20,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-29 05:50:20,500 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:50:20,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:20,501 INFO L85 PathProgramCache]: Analyzing trace with hash -78247716, now seen corresponding path program 1 times [2023-11-29 05:50:20,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:20,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682542511] [2023-11-29 05:50:20,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:20,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:20,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:20,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:50:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:20,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:50:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:20,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:20,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 05:50:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:20,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 05:50:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:20,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 05:50:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:20,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 05:50:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:20,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:20,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:50:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:20,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:50:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:20,819 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-29 05:50:20,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:20,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682542511] [2023-11-29 05:50:20,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682542511] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:50:20,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800345570] [2023-11-29 05:50:20,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:20,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:50:20,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:50:20,821 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:50:20,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 05:50:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:21,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 05:50:21,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:50:21,141 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-29 05:50:21,141 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:50:21,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800345570] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:21,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:50:21,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2023-11-29 05:50:21,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629771965] [2023-11-29 05:50:21,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:21,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:50:21,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:21,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:50:21,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:50:21,144 INFO L87 Difference]: Start difference. First operand 242 states and 321 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 05:50:21,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:50:21,392 INFO L93 Difference]: Finished difference Result 483 states and 646 transitions. [2023-11-29 05:50:21,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:50:21,393 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 84 [2023-11-29 05:50:21,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:50:21,395 INFO L225 Difference]: With dead ends: 483 [2023-11-29 05:50:21,395 INFO L226 Difference]: Without dead ends: 260 [2023-11-29 05:50:21,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2023-11-29 05:50:21,397 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 64 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:50:21,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 622 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:50:21,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-11-29 05:50:21,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 245. [2023-11-29 05:50:21,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 152 states have (on average 1.230263157894737) internal successors, (187), 157 states have internal predecessors, (187), 68 states have call successors, (68), 22 states have call predecessors, (68), 24 states have return successors, (69), 65 states have call predecessors, (69), 65 states have call successors, (69) [2023-11-29 05:50:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 324 transitions. [2023-11-29 05:50:21,439 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 324 transitions. Word has length 84 [2023-11-29 05:50:21,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:50:21,440 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 324 transitions. [2023-11-29 05:50:21,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 05:50:21,440 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 324 transitions. [2023-11-29 05:50:21,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 05:50:21,442 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:50:21,442 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:21,448 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 05:50:21,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:50:21,643 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:50:21,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:21,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1611357300, now seen corresponding path program 1 times [2023-11-29 05:50:21,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:21,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216791235] [2023-11-29 05:50:21,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:21,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:21,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:21,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:50:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:21,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:50:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:21,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:21,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 05:50:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:21,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 05:50:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:21,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:50:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:21,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 05:50:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:21,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:21,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:50:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:21,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 05:50:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:21,980 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-11-29 05:50:21,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:21,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216791235] [2023-11-29 05:50:21,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216791235] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:50:21,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491212767] [2023-11-29 05:50:21,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:21,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:50:21,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:50:21,982 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:50:21,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 05:50:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:22,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:50:22,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:50:22,197 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-29 05:50:22,197 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:50:22,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491212767] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:22,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:50:22,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-29 05:50:22,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72819000] [2023-11-29 05:50:22,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:22,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:50:22,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:22,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:50:22,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:50:22,200 INFO L87 Difference]: Start difference. First operand 245 states and 324 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-29 05:50:22,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:50:22,269 INFO L93 Difference]: Finished difference Result 471 states and 634 transitions. [2023-11-29 05:50:22,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:50:22,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 85 [2023-11-29 05:50:22,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:50:22,272 INFO L225 Difference]: With dead ends: 471 [2023-11-29 05:50:22,272 INFO L226 Difference]: Without dead ends: 257 [2023-11-29 05:50:22,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:50:22,273 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 2 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:50:22,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 197 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:50:22,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-11-29 05:50:22,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 248. [2023-11-29 05:50:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 155 states have (on average 1.2258064516129032) internal successors, (190), 160 states have internal predecessors, (190), 68 states have call successors, (68), 22 states have call predecessors, (68), 24 states have return successors, (69), 65 states have call predecessors, (69), 65 states have call successors, (69) [2023-11-29 05:50:22,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 327 transitions. [2023-11-29 05:50:22,300 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 327 transitions. Word has length 85 [2023-11-29 05:50:22,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:50:22,301 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 327 transitions. [2023-11-29 05:50:22,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-29 05:50:22,301 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 327 transitions. [2023-11-29 05:50:22,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-29 05:50:22,303 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:50:22,303 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:22,308 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 05:50:22,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 05:50:22,505 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:50:22,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:22,506 INFO L85 PathProgramCache]: Analyzing trace with hash 23218005, now seen corresponding path program 1 times [2023-11-29 05:50:22,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:22,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185649055] [2023-11-29 05:50:22,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:22,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:22,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:22,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:50:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:22,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:50:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:22,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:22,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 05:50:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:22,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 05:50:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:22,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:50:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:22,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 05:50:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:22,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 05:50:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:22,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:22,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 05:50:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:22,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 05:50:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:22,761 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-11-29 05:50:22,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:22,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185649055] [2023-11-29 05:50:22,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185649055] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:50:22,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128915445] [2023-11-29 05:50:22,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:22,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:50:22,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:50:22,762 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:50:22,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 05:50:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:22,996 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-29 05:50:22,999 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:50:23,143 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 56 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-29 05:50:23,143 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:50:23,366 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-11-29 05:50:23,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128915445] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:50:23,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:50:23,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 7] total 16 [2023-11-29 05:50:23,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804693177] [2023-11-29 05:50:23,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:50:23,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 05:50:23,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:23,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 05:50:23,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:50:23,368 INFO L87 Difference]: Start difference. First operand 248 states and 327 transitions. Second operand has 16 states, 12 states have (on average 6.333333333333333) internal successors, (76), 13 states have internal predecessors, (76), 6 states have call successors, (22), 2 states have call predecessors, (22), 7 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2023-11-29 05:50:23,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:50:23,627 INFO L93 Difference]: Finished difference Result 474 states and 625 transitions. [2023-11-29 05:50:23,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:50:23,628 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 6.333333333333333) internal successors, (76), 13 states have internal predecessors, (76), 6 states have call successors, (22), 2 states have call predecessors, (22), 7 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 92 [2023-11-29 05:50:23,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:50:23,631 INFO L225 Difference]: With dead ends: 474 [2023-11-29 05:50:23,631 INFO L226 Difference]: Without dead ends: 257 [2023-11-29 05:50:23,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-11-29 05:50:23,633 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 12 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:50:23,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1187 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:50:23,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-11-29 05:50:23,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 253. [2023-11-29 05:50:23,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 159 states have (on average 1.220125786163522) internal successors, (194), 165 states have internal predecessors, (194), 68 states have call successors, (68), 22 states have call predecessors, (68), 25 states have return successors, (71), 65 states have call predecessors, (71), 65 states have call successors, (71) [2023-11-29 05:50:23,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 333 transitions. [2023-11-29 05:50:23,678 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 333 transitions. Word has length 92 [2023-11-29 05:50:23,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:50:23,678 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 333 transitions. [2023-11-29 05:50:23,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 6.333333333333333) internal successors, (76), 13 states have internal predecessors, (76), 6 states have call successors, (22), 2 states have call predecessors, (22), 7 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2023-11-29 05:50:23,679 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 333 transitions. [2023-11-29 05:50:23,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-29 05:50:23,680 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:50:23,681 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:23,687 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 05:50:23,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 05:50:23,881 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:50:23,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:23,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1465792456, now seen corresponding path program 1 times [2023-11-29 05:50:23,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:23,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086278957] [2023-11-29 05:50:23,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:23,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:24,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:24,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:50:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:24,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:50:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:24,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:24,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 05:50:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:24,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 05:50:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:24,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:50:24,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:24,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 05:50:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:24,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:50:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:24,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:24,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 05:50:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:24,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 05:50:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:24,138 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 05:50:24,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:24,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086278957] [2023-11-29 05:50:24,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086278957] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:50:24,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569979566] [2023-11-29 05:50:24,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:24,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:50:24,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:50:24,140 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:50:24,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 05:50:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:24,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 05:50:24,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:50:24,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 05:50:24,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 05:50:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 49 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-29 05:50:24,629 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:50:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-11-29 05:50:24,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569979566] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:50:24,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:50:24,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 8] total 26 [2023-11-29 05:50:24,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052892169] [2023-11-29 05:50:24,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:50:24,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 05:50:24,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:24,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 05:50:24,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2023-11-29 05:50:24,907 INFO L87 Difference]: Start difference. First operand 253 states and 333 transitions. Second operand has 26 states, 24 states have (on average 4.166666666666667) internal successors, (100), 22 states have internal predecessors, (100), 8 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (25), 8 states have call predecessors, (25), 8 states have call successors, (25) [2023-11-29 05:50:26,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:50:26,197 INFO L93 Difference]: Finished difference Result 563 states and 775 transitions. [2023-11-29 05:50:26,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-29 05:50:26,198 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.166666666666667) internal successors, (100), 22 states have internal predecessors, (100), 8 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (25), 8 states have call predecessors, (25), 8 states have call successors, (25) Word has length 94 [2023-11-29 05:50:26,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:50:26,202 INFO L225 Difference]: With dead ends: 563 [2023-11-29 05:50:26,202 INFO L226 Difference]: Without dead ends: 338 [2023-11-29 05:50:26,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=339, Invalid=2523, Unknown=0, NotChecked=0, Total=2862 [2023-11-29 05:50:26,205 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 147 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:50:26,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1254 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:50:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2023-11-29 05:50:26,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 268. [2023-11-29 05:50:26,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 171 states have (on average 1.2222222222222223) internal successors, (209), 177 states have internal predecessors, (209), 68 states have call successors, (68), 22 states have call predecessors, (68), 28 states have return successors, (80), 68 states have call predecessors, (80), 65 states have call successors, (80) [2023-11-29 05:50:26,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 357 transitions. [2023-11-29 05:50:26,260 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 357 transitions. Word has length 94 [2023-11-29 05:50:26,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:50:26,261 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 357 transitions. [2023-11-29 05:50:26,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.166666666666667) internal successors, (100), 22 states have internal predecessors, (100), 8 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (25), 8 states have call predecessors, (25), 8 states have call successors, (25) [2023-11-29 05:50:26,261 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 357 transitions. [2023-11-29 05:50:26,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-29 05:50:26,262 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:50:26,263 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:26,269 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 05:50:26,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 05:50:26,463 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:50:26,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:26,463 INFO L85 PathProgramCache]: Analyzing trace with hash -990752224, now seen corresponding path program 1 times [2023-11-29 05:50:26,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:26,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988870125] [2023-11-29 05:50:26,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:26,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:27,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:27,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:50:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:27,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:50:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:27,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:27,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 05:50:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:27,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 05:50:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:27,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:50:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:27,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 05:50:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:27,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 05:50:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:27,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:50:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:27,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 05:50:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:27,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:50:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:27,524 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-11-29 05:50:27,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:27,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988870125] [2023-11-29 05:50:27,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988870125] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:50:27,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458988185] [2023-11-29 05:50:27,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:27,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:50:27,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:50:27,526 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:50:27,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 05:50:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:27,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-29 05:50:27,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:50:27,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-29 05:50:27,930 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-29 05:50:27,942 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 05:50:27,942 INFO L378 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 05:50:27,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 05:50:27,958 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 05:50:27,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 05:50:28,016 INFO L349 Elim1Store]: treesize reduction 64, result has 9.9 percent of original size [2023-11-29 05:50:28,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 22 [2023-11-29 05:50:28,851 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 51 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 05:50:28,852 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:50:33,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:50:33,274 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 39 [2023-11-29 05:50:33,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:50:33,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 441 treesize of output 395 [2023-11-29 05:50:33,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 288 treesize of output 280 [2023-11-29 05:50:33,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 05:50:33,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-11-29 05:50:33,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:50:33,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 76 [2023-11-29 05:50:33,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458988185] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:50:33,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:50:33,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2023-11-29 05:50:33,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447183054] [2023-11-29 05:50:33,627 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:50:33,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 05:50:33,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:33,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 05:50:33,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=945, Unknown=1, NotChecked=0, Total=1056 [2023-11-29 05:50:33,629 INFO L87 Difference]: Start difference. First operand 268 states and 357 transitions. Second operand has 26 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 10 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (23), 8 states have call predecessors, (23), 10 states have call successors, (23) [2023-11-29 05:50:37,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:50:41,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:50:45,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:50:49,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:50:53,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:50:57,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:51:01,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:51:03,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:51:03,766 INFO L93 Difference]: Finished difference Result 477 states and 654 transitions. [2023-11-29 05:51:03,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-29 05:51:03,766 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 10 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (23), 8 states have call predecessors, (23), 10 states have call successors, (23) Word has length 95 [2023-11-29 05:51:03,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:51:03,768 INFO L225 Difference]: With dead ends: 477 [2023-11-29 05:51:03,768 INFO L226 Difference]: Without dead ends: 310 [2023-11-29 05:51:03,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 184 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=345, Invalid=2624, Unknown=1, NotChecked=0, Total=2970 [2023-11-29 05:51:03,770 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 299 mSDsluCounter, 1345 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 146 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 1617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:51:03,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 1486 Invalid, 1617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1464 Invalid, 7 Unknown, 0 Unchecked, 29.5s Time] [2023-11-29 05:51:03,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2023-11-29 05:51:03,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 280. [2023-11-29 05:51:03,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 181 states have (on average 1.2430939226519337) internal successors, (225), 185 states have internal predecessors, (225), 70 states have call successors, (70), 22 states have call predecessors, (70), 28 states have return successors, (84), 72 states have call predecessors, (84), 67 states have call successors, (84) [2023-11-29 05:51:03,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 379 transitions. [2023-11-29 05:51:03,823 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 379 transitions. Word has length 95 [2023-11-29 05:51:03,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:51:03,823 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 379 transitions. [2023-11-29 05:51:03,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 10 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (23), 8 states have call predecessors, (23), 10 states have call successors, (23) [2023-11-29 05:51:03,824 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 379 transitions. [2023-11-29 05:51:03,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-29 05:51:03,825 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:51:03,826 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:51:03,832 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 05:51:04,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-29 05:51:04,026 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:51:04,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:04,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1114459894, now seen corresponding path program 1 times [2023-11-29 05:51:04,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:04,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586998159] [2023-11-29 05:51:04,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:04,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:04,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:51:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:04,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:51:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:04,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:51:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:04,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:51:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:04,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 05:51:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:04,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:51:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:05,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:51:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:05,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 05:51:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:05,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 05:51:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:05,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:51:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:05,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 05:51:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:05,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-29 05:51:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:05,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:51:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:05,369 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-11-29 05:51:05,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:51:05,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586998159] [2023-11-29 05:51:05,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586998159] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:51:05,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798939877] [2023-11-29 05:51:05,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:05,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:51:05,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:51:05,371 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:51:05,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 05:51:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:05,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 123 conjunts are in the unsatisfiable core [2023-11-29 05:51:05,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:51:05,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-29 05:51:05,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-29 05:51:09,461 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 64 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 05:51:09,462 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:51:19,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798939877] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:51:19,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:51:19,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 29] total 43 [2023-11-29 05:51:19,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105651396] [2023-11-29 05:51:19,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:51:19,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-29 05:51:19,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:51:19,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-29 05:51:19,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2864, Unknown=2, NotChecked=0, Total=3080 [2023-11-29 05:51:19,308 INFO L87 Difference]: Start difference. First operand 280 states and 379 transitions. Second operand has 43 states, 37 states have (on average 3.4054054054054053) internal successors, (126), 38 states have internal predecessors, (126), 17 states have call successors, (29), 6 states have call predecessors, (29), 10 states have return successors, (26), 15 states have call predecessors, (26), 17 states have call successors, (26) [2023-11-29 05:51:25,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:51:25,236 INFO L93 Difference]: Finished difference Result 396 states and 544 transitions. [2023-11-29 05:51:25,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-11-29 05:51:25,236 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 37 states have (on average 3.4054054054054053) internal successors, (126), 38 states have internal predecessors, (126), 17 states have call successors, (29), 6 states have call predecessors, (29), 10 states have return successors, (26), 15 states have call predecessors, (26), 17 states have call successors, (26) Word has length 106 [2023-11-29 05:51:25,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:51:25,239 INFO L225 Difference]: With dead ends: 396 [2023-11-29 05:51:25,239 INFO L226 Difference]: Without dead ends: 322 [2023-11-29 05:51:25,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 136 SyntacticMatches, 7 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1698 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=524, Invalid=6116, Unknown=2, NotChecked=0, Total=6642 [2023-11-29 05:51:25,243 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 202 mSDsluCounter, 2784 mSDsCounter, 0 mSdLazyCounter, 2999 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 2898 SdHoareTripleChecker+Invalid, 3135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 2999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:51:25,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 2898 Invalid, 3135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 2999 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-11-29 05:51:25,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2023-11-29 05:51:25,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 286. [2023-11-29 05:51:25,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 186 states have (on average 1.2580645161290323) internal successors, (234), 189 states have internal predecessors, (234), 71 states have call successors, (71), 22 states have call predecessors, (71), 28 states have return successors, (86), 74 states have call predecessors, (86), 68 states have call successors, (86) [2023-11-29 05:51:25,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 391 transitions. [2023-11-29 05:51:25,308 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 391 transitions. Word has length 106 [2023-11-29 05:51:25,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:51:25,308 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 391 transitions. [2023-11-29 05:51:25,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 37 states have (on average 3.4054054054054053) internal successors, (126), 38 states have internal predecessors, (126), 17 states have call successors, (29), 6 states have call predecessors, (29), 10 states have return successors, (26), 15 states have call predecessors, (26), 17 states have call successors, (26) [2023-11-29 05:51:25,309 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 391 transitions. [2023-11-29 05:51:25,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 05:51:25,310 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:51:25,310 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:51:25,317 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-29 05:51:25,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 05:51:25,511 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:51:25,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:25,511 INFO L85 PathProgramCache]: Analyzing trace with hash 392550324, now seen corresponding path program 2 times [2023-11-29 05:51:25,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:25,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857525255] [2023-11-29 05:51:25,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:25,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:27,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:51:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:27,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:51:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:27,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:51:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:27,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:51:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:27,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 05:51:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:27,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 05:51:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:27,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:51:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:27,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 05:51:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:27,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:51:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:27,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:51:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:27,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:51:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:27,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 05:51:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:27,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:51:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:27,606 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-29 05:51:27,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:51:27,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857525255] [2023-11-29 05:51:27,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857525255] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:51:27,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997071501] [2023-11-29 05:51:27,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:51:27,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:51:27,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:51:27,608 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:51:27,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 05:51:27,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:51:27,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:51:27,837 INFO L262 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-29 05:51:27,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:51:27,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 05:51:27,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:51:27,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 05:51:27,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-11-29 05:51:27,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 05:51:28,040 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|))) (let ((.cse0 (select .cse1 24))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|) 24 .cse0) .cse1)) (not (= .cse0 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| 0)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|) 24) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|)))) is different from true [2023-11-29 05:51:28,645 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.offset| 0) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65|) 24)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65|))) (let ((.cse0 (select .cse1 24))) (and (not (= 0 .cse0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65|) 24 .cse0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|))) (let ((.cse2 (select .cse3 24))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| v_DerPreprocessor_1) .cse2 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|) 24 .cse2) .cse3)) (not (= .cse2 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| 0)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|) 24) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|)))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base|))) (let ((.cse4 (select .cse5 24))) (or (and (not (= |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base| 0)) (= .cse4 |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base|)) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base|) 24 .cse4))) (not (= .cse4 0))))))) is different from true [2023-11-29 05:51:28,918 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65|) 24)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65|))) (let ((.cse0 (select .cse1 24))) (and (not (= 0 .cse0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65|) 24 .cse0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|))) (let ((.cse2 (select .cse3 24))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| v_DerPreprocessor_1) .cse2 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|) 24 .cse2) .cse3)) (not (= .cse2 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| 0)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|) 24) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|)))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| c_aws_linked_list_back_~list.base))) (let ((.cse4 (select .cse5 24))) (or (and (not (= .cse4 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| c_aws_linked_list_back_~list.base v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) c_aws_linked_list_back_~list.base) 24 .cse4)))) (and (not (= c_aws_linked_list_back_~list.base 0)) (= .cse4 c_aws_linked_list_back_~list.base))))) (= c_aws_linked_list_back_~list.offset 0)) is different from true [2023-11-29 05:51:28,957 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_35 Int)) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_35 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_35 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_35) 24)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_35 Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_35))) (let ((.cse0 (select .cse1 24))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_35 v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_35) 24 .cse0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65|) 24)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65|))) (let ((.cse2 (select .cse3 24))) (and (not (= 0 .cse2)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| v_DerPreprocessor_1) .cse2 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65|) 24 .cse2)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|))) (let ((.cse4 (select .cse5 24))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|) 24 .cse4) .cse5)) (not (= .cse4 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| 0)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|) 24) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|))))) is different from true [2023-11-29 05:51:30,277 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_35 Int)) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_35 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_35 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_35) 24)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_35 Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_35))) (let ((.cse0 (select .cse1 24))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_35 v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_35) 24 .cse0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65|) 24)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65|))) (let ((.cse2 (select .cse3 24))) (and (not (= 0 .cse2)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| v_DerPreprocessor_1) .cse2 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65|) 24 .cse2)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|))) (let ((.cse4 (select .cse5 24))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|) 24 .cse4) .cse5)) (not (= .cse4 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| 0)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|) 24) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|)))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_36 Int)) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_36 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_36) 24)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_36 0)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_36 Int)) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_36))) (let ((.cse6 (select .cse7 24))) (and (not (= .cse6 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_36 v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_36) 24 .cse6) .cse7)))))))) is different from true [2023-11-29 05:51:31,505 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_37 Int)) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_37 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_37) 24)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_37 0)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_37 Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_37))) (let ((.cse0 (select .cse1 24))) (and (not (= .cse0 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse1 (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_37 v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_37) 24 .cse0)))))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_35 Int)) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_35 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_35 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_35) 24)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_35 Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_35))) (let ((.cse2 (select .cse3 24))) (and (not (= .cse2 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_35 v_DerPreprocessor_1) .cse2 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_35) 24 .cse2)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65|) 24)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65|))) (let ((.cse4 (select .cse5 24))) (and (not (= 0 .cse4)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65|) 24 .cse4)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| Int)) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|))) (let ((.cse6 (select .cse7 24))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|) 24 .cse6) .cse7)) (not (= .cse6 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| 0)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|) 24) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|)))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_36 Int)) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_36 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_36) 24)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_36 0)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_36 Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_36))) (let ((.cse8 (select .cse9 24))) (and (not (= .cse8 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_36 v_DerPreprocessor_1) .cse8 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_36) 24 .cse8) .cse9))))))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| c_aws_linked_list_back_~list.base))) (let ((.cse10 (select .cse11 24))) (or (and (not (= .cse10 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse11 (store (select (store (store |c_#memory_$Pointer$#2.base| c_aws_linked_list_back_~list.base v_DerPreprocessor_1) .cse10 v_DerPreprocessor_2) c_aws_linked_list_back_~list.base) 24 .cse10)))) (and (not (= c_aws_linked_list_back_~list.base 0)) (= .cse10 c_aws_linked_list_back_~list.base))))) (= c_aws_linked_list_back_~list.offset 0)) is different from true [2023-11-29 05:51:31,563 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_38 Int)) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_38 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_38) 24)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_38 0)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_38 Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_38))) (let ((.cse1 (select .cse0 24))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse0 (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_38 v_DerPreprocessor_1) .cse1 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_38) 24 .cse1))) (not (= .cse1 0))))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_37 Int)) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_37 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_37) 24)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_37 0)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_37 Int)) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_37))) (let ((.cse2 (select .cse3 24))) (and (not (= .cse2 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_37 v_DerPreprocessor_1) .cse2 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_37) 24 .cse2)))))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_35 Int)) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_35 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_35 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_35) 24)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_35 Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_35))) (let ((.cse4 (select .cse5 24))) (and (not (= .cse4 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_35 v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_35) 24 .cse4)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65|) 24)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| Int)) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65|))) (let ((.cse6 (select .cse7 24))) (and (not (= 0 .cse6)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65|) 24 .cse6)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|))) (let ((.cse8 (select .cse9 24))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| v_DerPreprocessor_1) .cse8 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|) 24 .cse8) .cse9)) (not (= .cse8 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| 0)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|) 24) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|)))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_36 Int)) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_36 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_36) 24)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_36 0)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_36 Int)) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_36))) (let ((.cse10 (select .cse11 24))) (and (not (= .cse10 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_36 v_DerPreprocessor_1) .cse10 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_36) 24 .cse10) .cse11)))))))) is different from true [2023-11-29 05:51:33,767 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_39 Int)) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_39 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_39 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_39) 24)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_39 Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_39))) (let ((.cse1 (select .cse0 24))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse0 (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_39 v_DerPreprocessor_1) .cse1 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_39) 24 .cse1))) (not (= .cse1 0))))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_38 Int)) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_38 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_38) 24)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_38 0)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_38 Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_38))) (let ((.cse3 (select .cse2 24))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_38 v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_38) 24 .cse3))) (not (= .cse3 0))))))) (or |c_aws_linked_list_is_valid_#t~short310#1| (= 0 (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_37 Int)) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_37 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_37) 24)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_37 0)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_37 Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_37))) (let ((.cse4 (select .cse5 24))) (and (not (= .cse4 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_37 v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_37) 24 .cse4)))))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_35 Int)) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_35 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_35 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_35) 24)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_35 Int)) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_35))) (let ((.cse6 (select .cse7 24))) (and (not (= .cse6 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_35 v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_35) 24 .cse6)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65|) 24)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65|))) (let ((.cse8 (select .cse9 24))) (and (not (= 0 .cse8)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse9 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| v_DerPreprocessor_1) .cse8 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65|) 24 .cse8)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| Int)) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|))) (let ((.cse10 (select .cse11 24))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| v_DerPreprocessor_1) .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|) 24 .cse10) .cse11)) (not (= .cse10 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| 0)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|) 24) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|)))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_36 Int)) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_36 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_36) 24)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_36 0)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_36 Int)) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_36))) (let ((.cse12 (select .cse13 24))) (and (not (= .cse12 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_36 v_DerPreprocessor_1) .cse12 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_36) 24 .cse12) .cse13)))))))) is different from true [2023-11-29 05:51:33,845 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_39 Int)) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_39 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_39 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_39) 24)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_39 Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_39))) (let ((.cse1 (select .cse0 24))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse0 (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_39 v_DerPreprocessor_1) .cse1 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_39) 24 .cse1))) (not (= .cse1 0))))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_38 Int)) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_38 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_38) 24)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_38 0)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_38 Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_38))) (let ((.cse3 (select .cse2 24))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_38 v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_38) 24 .cse3))) (not (= .cse3 0))))))) (or |c_aws_linked_list_is_valid_#t~short312#1| (= 0 (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_37 Int)) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_37 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_37) 24)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_37 0)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_37 Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_37))) (let ((.cse4 (select .cse5 24))) (and (not (= .cse4 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_37 v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_37) 24 .cse4)))))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_35 Int)) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_35 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_35 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_35) 24)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_35 Int)) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_35))) (let ((.cse6 (select .cse7 24))) (and (not (= .cse6 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_35 v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_35) 24 .cse6)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65|) 24)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65|))) (let ((.cse8 (select .cse9 24))) (and (not (= 0 .cse8)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse9 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| v_DerPreprocessor_1) .cse8 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65|) 24 .cse8)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| Int)) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|))) (let ((.cse10 (select .cse11 24))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| v_DerPreprocessor_1) .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|) 24 .cse10) .cse11)) (not (= .cse10 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| 0)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|) 24) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|)))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_36 Int)) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_36 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_36) 24)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_36 0)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_36 Int)) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_36))) (let ((.cse12 (select .cse13 24))) (and (not (= .cse12 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_36 v_DerPreprocessor_1) .cse12 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_36) 24 .cse12) .cse13)))))))) is different from true [2023-11-29 05:51:33,932 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_39 Int)) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_39 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_39 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_39) 24)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_39 Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_39))) (let ((.cse1 (select .cse0 24))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse0 (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_39 v_DerPreprocessor_1) .cse1 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_39) 24 .cse1))) (not (= .cse1 0))))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_38 Int)) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_38 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_38) 24)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_38 0)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_38 Int)) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_38))) (let ((.cse3 (select .cse2 24))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_38 v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_38) 24 .cse3))) (not (= .cse3 0))))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_37 Int)) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_37 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_37) 24)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_37 0)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_37 Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_37))) (let ((.cse4 (select .cse5 24))) (and (not (= .cse4 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_37 v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_37) 24 .cse4)))))))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_35 Int)) (and (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_35 0)) (= v_aws_linked_list_back_~list.base_BEFORE_CALL_35 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_35) 24)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_35 Int)) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_35))) (let ((.cse6 (select .cse7 24))) (and (not (= .cse6 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_35 v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_35) 24 .cse6)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| Int)) (and (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65|) 24)) (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65|))) (let ((.cse8 (select .cse9 24))) (and (not (= 0 .cse8)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= .cse9 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65| v_DerPreprocessor_1) .cse8 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_65|) 24 .cse8)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| Int)) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|))) (let ((.cse10 (select .cse11 24))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| v_DerPreprocessor_1) .cse10 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|) 24 .cse10) .cse11)) (not (= .cse10 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64| 0)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|) 24) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_64|)))) (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_36 Int)) (and (= v_aws_linked_list_back_~list.base_BEFORE_CALL_36 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_36) 24)) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_36 0)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_36 Int)) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_36))) (let ((.cse12 (select .cse13 24))) (and (not (= .cse12 0)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_36 v_DerPreprocessor_1) .cse12 v_DerPreprocessor_2) v_aws_linked_list_back_~list.base_BEFORE_CALL_36) 24 .cse12) .cse13))))))) (= 0 (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)))) is different from true [2023-11-29 05:51:34,087 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 51 not checked. [2023-11-29 05:51:34,087 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:51:34,602 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2023-11-29 05:51:34,603 INFO L378 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 2 case distinctions, treesize of input 94 treesize of output 103 [2023-11-29 05:51:34,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:51:34,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 97 [2023-11-29 05:51:34,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2023-11-29 05:51:34,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-29 05:51:34,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-11-29 05:51:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-11-29 05:51:34,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997071501] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 05:51:34,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:51:34,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18, 24] total 49 [2023-11-29 05:51:34,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275075846] [2023-11-29 05:51:34,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:51:34,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:51:34,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:51:34,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:51:34,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1274, Unknown=104, NotChecked=830, Total=2352 [2023-11-29 05:51:34,859 INFO L87 Difference]: Start difference. First operand 286 states and 391 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 5 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 05:51:35,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:51:35,357 INFO L93 Difference]: Finished difference Result 511 states and 712 transitions. [2023-11-29 05:51:35,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:51:35,357 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 5 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 105 [2023-11-29 05:51:35,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:51:35,359 INFO L225 Difference]: With dead ends: 511 [2023-11-29 05:51:35,360 INFO L226 Difference]: Without dead ends: 292 [2023-11-29 05:51:35,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=163, Invalid=1495, Unknown=104, NotChecked=890, Total=2652 [2023-11-29 05:51:35,362 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 47 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:51:35,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 753 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:51:35,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-11-29 05:51:35,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 290. [2023-11-29 05:51:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 190 states have (on average 1.2526315789473683) internal successors, (238), 193 states have internal predecessors, (238), 71 states have call successors, (71), 22 states have call predecessors, (71), 28 states have return successors, (86), 74 states have call predecessors, (86), 68 states have call successors, (86) [2023-11-29 05:51:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 395 transitions. [2023-11-29 05:51:35,421 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 395 transitions. Word has length 105 [2023-11-29 05:51:35,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:51:35,422 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 395 transitions. [2023-11-29 05:51:35,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 10 states have internal predecessors, (51), 5 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 05:51:35,422 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 395 transitions. [2023-11-29 05:51:35,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 05:51:35,423 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:51:35,424 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:51:35,430 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-29 05:51:35,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 05:51:35,625 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:51:35,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:35,626 INFO L85 PathProgramCache]: Analyzing trace with hash -476686, now seen corresponding path program 1 times [2023-11-29 05:51:35,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:35,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129327598] [2023-11-29 05:51:35,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:35,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:36,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:51:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:36,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:51:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:36,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:51:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:36,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:51:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:36,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 05:51:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:36,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 05:51:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:36,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:51:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:36,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 05:51:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:36,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:51:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:36,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:51:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:36,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:51:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:36,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 05:51:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:36,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:51:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:36,928 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2023-11-29 05:51:36,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:51:36,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129327598] [2023-11-29 05:51:36,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129327598] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:51:36,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230503206] [2023-11-29 05:51:36,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:36,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:51:36,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:51:36,930 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:51:36,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-29 05:51:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:37,164 INFO L262 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-29 05:51:37,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:51:37,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 05:51:37,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 05:51:38,345 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 46 proven. 5 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-29 05:51:38,345 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:51:38,954 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-11-29 05:51:38,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230503206] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:51:38,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:51:38,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 11] total 33 [2023-11-29 05:51:38,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99968650] [2023-11-29 05:51:38,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:51:38,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-29 05:51:38,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:51:38,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 05:51:38,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 05:51:38,957 INFO L87 Difference]: Start difference. First operand 290 states and 395 transitions. Second operand has 33 states, 32 states have (on average 3.65625) internal successors, (117), 32 states have internal predecessors, (117), 10 states have call successors, (32), 5 states have call predecessors, (32), 8 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) [2023-11-29 05:51:43,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:51:47,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:51:49,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:51:49,187 INFO L93 Difference]: Finished difference Result 925 states and 1286 transitions. [2023-11-29 05:51:49,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-29 05:51:49,188 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.65625) internal successors, (117), 32 states have internal predecessors, (117), 10 states have call successors, (32), 5 states have call predecessors, (32), 8 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) Word has length 105 [2023-11-29 05:51:49,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:51:49,193 INFO L225 Difference]: With dead ends: 925 [2023-11-29 05:51:49,193 INFO L226 Difference]: Without dead ends: 774 [2023-11-29 05:51:49,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 207 SyntacticMatches, 9 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=494, Invalid=2476, Unknown=0, NotChecked=0, Total=2970 [2023-11-29 05:51:49,197 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 538 mSDsluCounter, 1541 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 136 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:51:49,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1663 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1397 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2023-11-29 05:51:49,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2023-11-29 05:51:49,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 608. [2023-11-29 05:51:49,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 431 states have (on average 1.2784222737819027) internal successors, (551), 430 states have internal predecessors, (551), 119 states have call successors, (119), 42 states have call predecessors, (119), 57 states have return successors, (159), 135 states have call predecessors, (159), 114 states have call successors, (159) [2023-11-29 05:51:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 829 transitions. [2023-11-29 05:51:49,328 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 829 transitions. Word has length 105 [2023-11-29 05:51:49,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:51:49,328 INFO L495 AbstractCegarLoop]: Abstraction has 608 states and 829 transitions. [2023-11-29 05:51:49,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.65625) internal successors, (117), 32 states have internal predecessors, (117), 10 states have call successors, (32), 5 states have call predecessors, (32), 8 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) [2023-11-29 05:51:49,329 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 829 transitions. [2023-11-29 05:51:49,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 05:51:49,330 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:51:49,330 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:51:49,337 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-29 05:51:49,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 05:51:49,531 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:51:49,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:49,531 INFO L85 PathProgramCache]: Analyzing trace with hash 953463472, now seen corresponding path program 1 times [2023-11-29 05:51:49,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:49,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148240562] [2023-11-29 05:51:49,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:49,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:49,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:51:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:49,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:51:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:49,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:51:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:49,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:51:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:49,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 05:51:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:49,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 05:51:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:49,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:51:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:49,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 05:51:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:49,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:51:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:49,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:51:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:49,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:51:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:49,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 05:51:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:49,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:51:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:49,702 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-11-29 05:51:49,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:51:49,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148240562] [2023-11-29 05:51:49,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148240562] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:51:49,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113557211] [2023-11-29 05:51:49,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:49,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:51:49,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:51:49,704 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:51:49,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-29 05:51:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:49,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:51:49,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:51:49,920 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-11-29 05:51:49,920 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:51:49,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113557211] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:51:49,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:51:49,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-29 05:51:49,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314583075] [2023-11-29 05:51:49,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:51:49,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:51:49,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:51:49,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:51:49,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:51:49,922 INFO L87 Difference]: Start difference. First operand 608 states and 829 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 05:51:50,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:51:50,020 INFO L93 Difference]: Finished difference Result 859 states and 1164 transitions. [2023-11-29 05:51:50,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:51:50,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2023-11-29 05:51:50,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:51:50,024 INFO L225 Difference]: With dead ends: 859 [2023-11-29 05:51:50,024 INFO L226 Difference]: Without dead ends: 425 [2023-11-29 05:51:50,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:51:50,027 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 3 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:51:50,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 298 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:51:50,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2023-11-29 05:51:50,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 413. [2023-11-29 05:51:50,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 294 states have (on average 1.1904761904761905) internal successors, (350), 295 states have internal predecessors, (350), 79 states have call successors, (79), 36 states have call predecessors, (79), 39 states have return successors, (89), 81 states have call predecessors, (89), 76 states have call successors, (89) [2023-11-29 05:51:50,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 518 transitions. [2023-11-29 05:51:50,128 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 518 transitions. Word has length 105 [2023-11-29 05:51:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:51:50,129 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 518 transitions. [2023-11-29 05:51:50,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 05:51:50,129 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 518 transitions. [2023-11-29 05:51:50,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 05:51:50,130 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:51:50,130 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:51:50,136 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-11-29 05:51:50,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 05:51:50,331 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:51:50,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:50,331 INFO L85 PathProgramCache]: Analyzing trace with hash 257688752, now seen corresponding path program 1 times [2023-11-29 05:51:50,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:50,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682181792] [2023-11-29 05:51:50,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:50,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:50,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:51:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:50,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:51:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:50,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:51:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:50,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:51:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:50,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-29 05:51:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:50,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 05:51:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:50,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:51:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:50,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 05:51:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:50,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:51:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:50,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:51:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:50,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:51:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:50,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 05:51:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:50,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:51:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:50,952 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-11-29 05:51:50,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:51:50,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682181792] [2023-11-29 05:51:50,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682181792] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:51:50,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074740260] [2023-11-29 05:51:50,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:50,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:51:50,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:51:50,954 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:51:50,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-29 05:51:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:51,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 76 conjunts are in the unsatisfiable core [2023-11-29 05:51:51,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:51:51,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-29 05:51:51,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-29 05:51:51,398 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 05:51:51,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 05:51:51,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 05:51:51,415 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 05:51:51,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 05:51:51,479 INFO L349 Elim1Store]: treesize reduction 64, result has 9.9 percent of original size [2023-11-29 05:51:51,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 26 [2023-11-29 05:51:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 05:51:53,104 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:51:57,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:51:57,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 39 [2023-11-29 05:51:57,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:51:57,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 448 treesize of output 400 [2023-11-29 05:51:57,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 288 treesize of output 280 [2023-11-29 05:51:57,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-11-29 05:51:57,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 05:51:57,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 05:51:57,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:51:57,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 101 [2023-11-29 05:51:58,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074740260] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:51:58,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:51:58,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 25 [2023-11-29 05:51:58,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81441152] [2023-11-29 05:51:58,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:51:58,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 05:51:58,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:51:58,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 05:51:58,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1076, Unknown=1, NotChecked=0, Total=1190 [2023-11-29 05:51:58,284 INFO L87 Difference]: Start difference. First operand 413 states and 518 transitions. Second operand has 25 states, 25 states have (on average 4.24) internal successors, (106), 24 states have internal predecessors, (106), 10 states have call successors, (27), 5 states have call predecessors, (27), 6 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) [2023-11-29 05:52:02,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:52:06,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:52:10,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:52:14,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:52:18,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:52:22,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:52:26,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:52:29,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:52:29,199 INFO L93 Difference]: Finished difference Result 800 states and 1036 transitions. [2023-11-29 05:52:29,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-29 05:52:29,200 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.24) internal successors, (106), 24 states have internal predecessors, (106), 10 states have call successors, (27), 5 states have call predecessors, (27), 6 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) Word has length 105 [2023-11-29 05:52:29,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:52:29,203 INFO L225 Difference]: With dead ends: 800 [2023-11-29 05:52:29,203 INFO L226 Difference]: Without dead ends: 493 [2023-11-29 05:52:29,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 192 SyntacticMatches, 15 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 970 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=481, Invalid=3678, Unknown=1, NotChecked=0, Total=4160 [2023-11-29 05:52:29,206 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 332 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 1829 mSolverCounterSat, 109 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1829 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:52:29,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1392 Invalid, 1945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1829 Invalid, 7 Unknown, 0 Unchecked, 29.8s Time] [2023-11-29 05:52:29,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2023-11-29 05:52:29,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 444. [2023-11-29 05:52:29,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 320 states have (on average 1.171875) internal successors, (375), 321 states have internal predecessors, (375), 83 states have call successors, (83), 37 states have call predecessors, (83), 40 states have return successors, (98), 85 states have call predecessors, (98), 80 states have call successors, (98) [2023-11-29 05:52:29,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 556 transitions. [2023-11-29 05:52:29,293 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 556 transitions. Word has length 105 [2023-11-29 05:52:29,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:52:29,293 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 556 transitions. [2023-11-29 05:52:29,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.24) internal successors, (106), 24 states have internal predecessors, (106), 10 states have call successors, (27), 5 states have call predecessors, (27), 6 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) [2023-11-29 05:52:29,293 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 556 transitions. [2023-11-29 05:52:29,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-29 05:52:29,294 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:52:29,294 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:52:29,299 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-11-29 05:52:29,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 05:52:29,495 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:52:29,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:52:29,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1773178958, now seen corresponding path program 1 times [2023-11-29 05:52:29,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:52:29,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776686043] [2023-11-29 05:52:29,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:52:29,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:52:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:52:30,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:52:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:52:30,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:52:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:52:30,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:52:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:52:30,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:52:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:52:30,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 05:52:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:52:30,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 05:52:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:52:30,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:52:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:52:30,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 05:52:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:52:30,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 05:52:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:52:30,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 05:52:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:52:30,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:52:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:52:30,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 05:52:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:52:30,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 05:52:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:52:30,868 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2023-11-29 05:52:30,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:52:30,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776686043] [2023-11-29 05:52:30,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776686043] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:52:30,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629421379] [2023-11-29 05:52:30,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:52:30,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:52:30,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:52:30,870 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:52:30,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-29 05:52:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:52:31,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 103 conjunts are in the unsatisfiable core [2023-11-29 05:52:31,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:52:31,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-29 05:52:31,319 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-29 05:52:31,331 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 05:52:31,331 INFO L378 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 05:52:31,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 05:52:31,344 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-29 05:52:31,357 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 05:52:31,357 INFO L378 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 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-29 05:52:31,379 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 05:52:31,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 05:52:31,464 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 05:52:31,464 INFO L378 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 52 [2023-11-29 05:52:31,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:52:31,476 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-29 05:52:31,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 57 [2023-11-29 05:52:31,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:52:31,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2023-11-29 05:52:31,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:52:31,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:52:31,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2023-11-29 05:52:31,505 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2023-11-29 05:52:31,505 INFO L378 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 31 [2023-11-29 05:52:31,600 INFO L349 Elim1Store]: treesize reduction 143, result has 9.5 percent of original size [2023-11-29 05:52:31,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 208 treesize of output 76 [2023-11-29 05:52:31,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:52:31,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 26 [2023-11-29 05:52:33,438 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 54 proven. 19 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-29 05:52:33,438 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:52:34,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:52:34,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 245 treesize of output 233 [2023-11-29 05:52:34,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:52:34,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 205 [2023-11-29 05:52:34,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:52:34,614 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 281 treesize of output 241 [2023-11-29 05:52:34,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:52:34,632 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 193 [2023-11-29 05:52:35,159 INFO L349 Elim1Store]: treesize reduction 200, result has 58.4 percent of original size [2023-11-29 05:52:35,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 107444 treesize of output 96295 [2023-11-29 05:52:38,739 INFO L349 Elim1Store]: treesize reduction 238, result has 57.0 percent of original size [2023-11-29 05:52:38,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 2114993 treesize of output 2035697 [2023-11-29 05:52:42,877 INFO L349 Elim1Store]: treesize reduction 154, result has 53.5 percent of original size [2023-11-29 05:52:42,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 30618 treesize of output 28588 [2023-11-29 05:52:46,239 INFO L349 Elim1Store]: treesize reduction 154, result has 53.5 percent of original size [2023-11-29 05:52:46,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 32385 treesize of output 31509 [2023-11-29 05:52:50,844 INFO L349 Elim1Store]: treesize reduction 79, result has 71.5 percent of original size [2023-11-29 05:52:50,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 28395 treesize of output 27294 [2023-11-29 05:52:55,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:52:55,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 27485 treesize of output 27066 [2023-11-29 05:57:13,356 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-11-29 05:57:13,356 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-29 05:57:13,358 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-29 05:57:13,363 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-11-29 05:57:13,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:57:13,558 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 68 more [2023-11-29 05:57:13,562 INFO L158 Benchmark]: Toolchain (without parser) took 459562.01ms. Allocated memory was 163.6MB in the beginning and 799.0MB in the end (delta: 635.4MB). Free memory was 122.1MB in the beginning and 480.3MB in the end (delta: -358.2MB). Peak memory consumption was 508.4MB. Max. memory is 16.1GB. [2023-11-29 05:57:13,562 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:57:13,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2085.57ms. Allocated memory is still 163.6MB. Free memory was 122.1MB in the beginning and 114.9MB in the end (delta: 7.2MB). Peak memory consumption was 107.1MB. Max. memory is 16.1GB. [2023-11-29 05:57:13,562 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.99ms. Allocated memory is still 163.6MB. Free memory was 114.9MB in the beginning and 109.5MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 05:57:13,563 INFO L158 Benchmark]: Boogie Preprocessor took 75.18ms. Allocated memory is still 163.6MB. Free memory was 109.5MB in the beginning and 104.4MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:57:13,563 INFO L158 Benchmark]: RCFGBuilder took 550.25ms. Allocated memory is still 163.6MB. Free memory was 104.4MB in the beginning and 74.8MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-11-29 05:57:13,563 INFO L158 Benchmark]: TraceAbstraction took 456735.13ms. Allocated memory was 163.6MB in the beginning and 799.0MB in the end (delta: 635.4MB). Free memory was 73.9MB in the beginning and 480.3MB in the end (delta: -406.5MB). Peak memory consumption was 460.0MB. Max. memory is 16.1GB. [2023-11-29 05:57:13,565 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2085.57ms. Allocated memory is still 163.6MB. Free memory was 122.1MB in the beginning and 114.9MB in the end (delta: 7.2MB). Peak memory consumption was 107.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 109.99ms. Allocated memory is still 163.6MB. Free memory was 114.9MB in the beginning and 109.5MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.18ms. Allocated memory is still 163.6MB. Free memory was 109.5MB in the beginning and 104.4MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 550.25ms. Allocated memory is still 163.6MB. Free memory was 104.4MB in the beginning and 74.8MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 456735.13ms. Allocated memory was 163.6MB in the beginning and 799.0MB in the end (delta: 635.4MB). Free memory was 73.9MB in the beginning and 480.3MB in the end (delta: -406.5MB). Peak memory consumption was 460.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f57bc64edf303a057c8eafb48480d4e5b764bd411481261d53eb2a101eb82ae8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:57:15,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:57:15,353 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-11-29 05:57:15,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:57:15,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:57:15,388 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:57:15,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:57:15,389 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:57:15,390 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:57:15,390 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:57:15,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:57:15,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:57:15,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:57:15,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:57:15,393 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:57:15,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:57:15,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:57:15,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:57:15,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:57:15,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:57:15,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:57:15,399 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:57:15,400 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 05:57:15,400 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 05:57:15,400 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:57:15,401 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:57:15,401 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:57:15,402 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:57:15,402 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:57:15,402 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:57:15,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:57:15,403 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:57:15,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:57:15,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:57:15,404 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 05:57:15,404 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 05:57:15,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:57:15,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:57:15,405 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:57:15,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:57:15,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:57:15,406 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 05:57:15,406 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_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f57bc64edf303a057c8eafb48480d4e5b764bd411481261d53eb2a101eb82ae8 [2023-11-29 05:57:15,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:57:15,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:57:15,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:57:15,718 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:57:15,718 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:57:15,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i [2023-11-29 05:57:18,447 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:57:18,836 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:57:18,837 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i [2023-11-29 05:57:18,863 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/data/9f5053466/a0c4ee9094284af49f8ee97d81ab0ecf/FLAGeb7086b0b [2023-11-29 05:57:18,875 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/data/9f5053466/a0c4ee9094284af49f8ee97d81ab0ecf [2023-11-29 05:57:18,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:57:18,879 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:57:18,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:57:18,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:57:18,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:57:18,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:57:18" (1/1) ... [2023-11-29 05:57:18,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@290ebb92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:18, skipping insertion in model container [2023-11-29 05:57:18,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:57:18" (1/1) ... [2023-11-29 05:57:19,000 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:57:19,197 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_a2caee67-a04a-43c7-8eae-0ab5458bba3c/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i[4494,4507] [2023-11-29 05:57:19,202 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_a2caee67-a04a-43c7-8eae-0ab5458bba3c/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i[4554,4567] [2023-11-29 05:57:19,740 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:19,741 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:19,741 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:19,742 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:19,743 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:19,760 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:19,761 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:19,763 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:19,764 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:19,766 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:19,767 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:19,768 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:19,768 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:20,050 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-29 05:57:20,052 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-29 05:57:20,053 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-29 05:57:20,054 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-29 05:57:20,056 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-29 05:57:20,056 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-29 05:57:20,057 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-29 05:57:20,058 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-29 05:57:20,059 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-29 05:57:20,060 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-29 05:57:20,202 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:57:20,224 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 05:57:20,249 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:57:20,253 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_a2caee67-a04a-43c7-8eae-0ab5458bba3c/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i[4494,4507] [2023-11-29 05:57:20,254 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_a2caee67-a04a-43c7-8eae-0ab5458bba3c/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i[4554,4567] [2023-11-29 05:57:20,293 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:20,294 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:20,295 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:20,295 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:20,296 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:20,304 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:20,305 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:20,306 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:20,306 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:20,307 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:20,308 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:20,309 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:20,309 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:20,358 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-29 05:57:20,359 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-29 05:57:20,360 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-29 05:57:20,360 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-29 05:57:20,361 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-29 05:57:20,362 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-29 05:57:20,362 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-29 05:57:20,363 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-29 05:57:20,364 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-29 05:57:20,364 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-29 05:57:20,404 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:57:20,412 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:57:20,423 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_a2caee67-a04a-43c7-8eae-0ab5458bba3c/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i[4494,4507] [2023-11-29 05:57:20,423 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_a2caee67-a04a-43c7-8eae-0ab5458bba3c/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i[4554,4567] [2023-11-29 05:57:20,460 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:20,460 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:20,461 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:20,461 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:20,462 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:20,470 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:20,470 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:20,471 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:20,471 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:20,472 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:20,473 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:20,473 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:20,473 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-29 05:57:20,500 WARN L638 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-29 05:57:20,500 WARN L638 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-29 05:57:20,501 WARN L638 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-29 05:57:20,501 WARN L638 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-29 05:57:20,502 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-29 05:57:20,502 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-29 05:57:20,502 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-29 05:57:20,502 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-29 05:57:20,503 WARN L638 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-29 05:57:20,503 WARN L638 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-29 05:57:20,535 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:57:20,783 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:57:20,784 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:57:20,784 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:57:20,784 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:57:20,784 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:57:20,784 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:57:20,785 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:57:20,785 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:57:20,785 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:57:20,785 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:57:20,785 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:57:20,785 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:57:20,785 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:57:20,785 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:57:20,786 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:57:20,786 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:57:20,792 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:57:20,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:20 WrapperNode [2023-11-29 05:57:20,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:57:20,793 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:57:20,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:57:20,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:57:20,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:20" (1/1) ... [2023-11-29 05:57:20,873 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:20" (1/1) ... [2023-11-29 05:57:20,913 INFO L138 Inliner]: procedures = 697, calls = 1045, calls flagged for inlining = 50, calls inlined = 5, statements flattened = 134 [2023-11-29 05:57:20,914 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:57:20,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:57:20,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:57:20,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:57:20,923 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:20" (1/1) ... [2023-11-29 05:57:20,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:20" (1/1) ... [2023-11-29 05:57:20,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:20" (1/1) ... [2023-11-29 05:57:20,952 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 5, 20]. 74 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2023-11-29 05:57:20,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:20" (1/1) ... [2023-11-29 05:57:20,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:20" (1/1) ... [2023-11-29 05:57:20,968 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:20" (1/1) ... [2023-11-29 05:57:20,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:20" (1/1) ... [2023-11-29 05:57:20,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:20" (1/1) ... [2023-11-29 05:57:20,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:20" (1/1) ... [2023-11-29 05:57:20,990 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:57:20,991 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:57:20,991 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:57:20,991 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:57:20,992 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:20" (1/1) ... [2023-11-29 05:57:20,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:57:21,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:57:21,019 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:57:21,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:57:21,068 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_back [2023-11-29 05:57:21,068 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_back [2023-11-29 05:57:21,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:57:21,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 05:57:21,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 05:57:21,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 05:57:21,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 05:57:21,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 05:57:21,069 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-29 05:57:21,069 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-29 05:57:21,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 05:57:21,070 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-29 05:57:21,070 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-29 05:57:21,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:57:21,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 05:57:21,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 05:57:21,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 05:57:21,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:57:21,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:57:21,071 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2023-11-29 05:57:21,071 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2023-11-29 05:57:21,071 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 05:57:21,071 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 05:57:21,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:57:21,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 05:57:21,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 05:57:21,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 05:57:21,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 05:57:21,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 05:57:21,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 05:57:21,072 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-29 05:57:21,072 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-29 05:57:21,072 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-29 05:57:21,073 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-29 05:57:21,296 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:57:21,297 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:57:21,638 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:57:21,677 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:57:21,677 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 05:57:21,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:57:21 BoogieIcfgContainer [2023-11-29 05:57:21,678 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:57:21,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:57:21,681 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:57:21,684 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:57:21,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:57:18" (1/3) ... [2023-11-29 05:57:21,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af71cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:57:21, skipping insertion in model container [2023-11-29 05:57:21,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:57:20" (2/3) ... [2023-11-29 05:57:21,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af71cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:57:21, skipping insertion in model container [2023-11-29 05:57:21,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:57:21" (3/3) ... [2023-11-29 05:57:21,687 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_back_harness.i [2023-11-29 05:57:21,705 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:57:21,706 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:57:21,755 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:57:21,761 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@58a12c86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:57:21,761 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:57:21,766 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 54 states have internal predecessors, (72), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 05:57:21,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-29 05:57:21,778 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:21,779 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:57:21,780 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:21,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:21,785 INFO L85 PathProgramCache]: Analyzing trace with hash 24712143, now seen corresponding path program 1 times [2023-11-29 05:57:21,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:57:21,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719977340] [2023-11-29 05:57:21,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:21,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:57:21,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:57:21,802 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:57:21,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 05:57:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:22,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 05:57:22,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:22,126 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-29 05:57:22,126 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:57:22,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:57:22,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719977340] [2023-11-29 05:57:22,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [719977340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:57:22,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:57:22,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:57:22,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532800396] [2023-11-29 05:57:22,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:57:22,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:57:22,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:57:22,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:57:22,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:57:22,159 INFO L87 Difference]: Start difference. First operand has 87 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 54 states have internal predecessors, (72), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 05:57:22,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:22,251 INFO L93 Difference]: Finished difference Result 168 states and 251 transitions. [2023-11-29 05:57:22,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:57:22,254 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 79 [2023-11-29 05:57:22,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:57:22,261 INFO L225 Difference]: With dead ends: 168 [2023-11-29 05:57:22,261 INFO L226 Difference]: Without dead ends: 85 [2023-11-29 05:57:22,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:57:22,267 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:57:22,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:57:22,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-29 05:57:22,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-11-29 05:57:22,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 53 states have internal predecessors, (67), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 05:57:22,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 114 transitions. [2023-11-29 05:57:22,308 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 114 transitions. Word has length 79 [2023-11-29 05:57:22,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:57:22,308 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 114 transitions. [2023-11-29 05:57:22,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 05:57:22,309 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 114 transitions. [2023-11-29 05:57:22,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-29 05:57:22,313 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:22,313 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:57:22,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:57:22,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:57:22,515 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:22,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:22,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1865722609, now seen corresponding path program 1 times [2023-11-29 05:57:22,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:57:22,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735385554] [2023-11-29 05:57:22,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:22,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:57:22,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:57:22,518 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:57:22,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 05:57:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:22,786 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:57:22,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-29 05:57:22,857 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:57:22,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:57:22,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735385554] [2023-11-29 05:57:22,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735385554] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:57:22,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:57:22,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:57:22,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098044674] [2023-11-29 05:57:22,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:57:22,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:57:22,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:57:22,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:57:22,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:57:22,862 INFO L87 Difference]: Start difference. First operand 85 states and 114 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 05:57:23,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:23,163 INFO L93 Difference]: Finished difference Result 157 states and 212 transitions. [2023-11-29 05:57:23,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:57:23,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 79 [2023-11-29 05:57:23,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:57:23,167 INFO L225 Difference]: With dead ends: 157 [2023-11-29 05:57:23,168 INFO L226 Difference]: Without dead ends: 87 [2023-11-29 05:57:23,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:57:23,170 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 2 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:57:23,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 483 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:57:23,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-29 05:57:23,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-11-29 05:57:23,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 55 states have internal predecessors, (68), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2023-11-29 05:57:23,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2023-11-29 05:57:23,185 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 117 transitions. Word has length 79 [2023-11-29 05:57:23,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:57:23,185 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 117 transitions. [2023-11-29 05:57:23,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 05:57:23,186 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2023-11-29 05:57:23,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-29 05:57:23,187 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:23,188 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:57:23,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 05:57:23,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:57:23,388 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:23,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:23,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1453349203, now seen corresponding path program 1 times [2023-11-29 05:57:23,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:57:23,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1867815227] [2023-11-29 05:57:23,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:23,390 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:57:23,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:57:23,391 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:57:23,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 05:57:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:23,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 05:57:23,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 05:57:23,770 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:57:23,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:57:23,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1867815227] [2023-11-29 05:57:23,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1867815227] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:57:23,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:57:23,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:57:23,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630885126] [2023-11-29 05:57:23,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:57:23,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:57:23,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:57:23,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:57:23,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:57:23,773 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 05:57:24,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:24,249 INFO L93 Difference]: Finished difference Result 162 states and 219 transitions. [2023-11-29 05:57:24,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:57:24,250 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 81 [2023-11-29 05:57:24,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:57:24,252 INFO L225 Difference]: With dead ends: 162 [2023-11-29 05:57:24,252 INFO L226 Difference]: Without dead ends: 87 [2023-11-29 05:57:24,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:57:24,254 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 43 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:57:24,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 566 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:57:24,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-29 05:57:24,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-11-29 05:57:24,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 55 states have internal predecessors, (67), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2023-11-29 05:57:24,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 116 transitions. [2023-11-29 05:57:24,269 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 116 transitions. Word has length 81 [2023-11-29 05:57:24,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:57:24,269 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 116 transitions. [2023-11-29 05:57:24,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 05:57:24,270 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 116 transitions. [2023-11-29 05:57:24,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-29 05:57:24,271 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:24,271 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:57:24,278 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 05:57:24,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:57:24,478 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:24,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:24,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1848658630, now seen corresponding path program 1 times [2023-11-29 05:57:24,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:57:24,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1421546965] [2023-11-29 05:57:24,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:24,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:57:24,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:57:24,480 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:57:24,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 05:57:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:24,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 05:57:24,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:24,824 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 05:57:24,824 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:57:24,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:57:24,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1421546965] [2023-11-29 05:57:24,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1421546965] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:57:24,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:57:24,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:57:24,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85725876] [2023-11-29 05:57:24,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:57:24,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:57:24,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:57:24,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:57:24,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:57:24,833 INFO L87 Difference]: Start difference. First operand 87 states and 116 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 05:57:25,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:25,368 INFO L93 Difference]: Finished difference Result 169 states and 228 transitions. [2023-11-29 05:57:25,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:57:25,368 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 83 [2023-11-29 05:57:25,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:57:25,370 INFO L225 Difference]: With dead ends: 169 [2023-11-29 05:57:25,370 INFO L226 Difference]: Without dead ends: 93 [2023-11-29 05:57:25,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:57:25,372 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 65 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:57:25,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 635 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:57:25,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-29 05:57:25,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2023-11-29 05:57:25,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 56 states have internal predecessors, (68), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2023-11-29 05:57:25,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 117 transitions. [2023-11-29 05:57:25,389 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 117 transitions. Word has length 83 [2023-11-29 05:57:25,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:57:25,389 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 117 transitions. [2023-11-29 05:57:25,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 05:57:25,390 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 117 transitions. [2023-11-29 05:57:25,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-29 05:57:25,391 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:25,392 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:57:25,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 05:57:25,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:57:25,599 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:25,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:25,599 INFO L85 PathProgramCache]: Analyzing trace with hash -517397722, now seen corresponding path program 1 times [2023-11-29 05:57:25,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:57:25,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566701322] [2023-11-29 05:57:25,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:25,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:57:25,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:57:25,601 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:57:25,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 05:57:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:25,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 05:57:25,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:25,926 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-29 05:57:25,926 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:57:25,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:57:25,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566701322] [2023-11-29 05:57:25,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566701322] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:57:25,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:57:25,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:57:25,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118884993] [2023-11-29 05:57:25,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:57:25,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:57:25,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:57:25,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:57:25,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:57:25,930 INFO L87 Difference]: Start difference. First operand 88 states and 117 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 05:57:26,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:26,381 INFO L93 Difference]: Finished difference Result 165 states and 224 transitions. [2023-11-29 05:57:26,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:57:26,383 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 84 [2023-11-29 05:57:26,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:57:26,385 INFO L225 Difference]: With dead ends: 165 [2023-11-29 05:57:26,385 INFO L226 Difference]: Without dead ends: 92 [2023-11-29 05:57:26,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:57:26,387 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 49 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:57:26,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 469 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:57:26,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-29 05:57:26,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2023-11-29 05:57:26,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 57 states have internal predecessors, (69), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2023-11-29 05:57:26,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2023-11-29 05:57:26,410 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 84 [2023-11-29 05:57:26,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:57:26,411 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2023-11-29 05:57:26,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 05:57:26,412 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2023-11-29 05:57:26,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-29 05:57:26,413 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:26,413 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:57:26,423 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 05:57:26,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:57:26,627 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:26,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:26,628 INFO L85 PathProgramCache]: Analyzing trace with hash -732274369, now seen corresponding path program 1 times [2023-11-29 05:57:26,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:57:26,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842084752] [2023-11-29 05:57:26,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:26,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:57:26,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:57:26,629 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:57:26,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 05:57:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:26,841 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:57:26,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:26,888 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-29 05:57:26,888 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:57:26,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:57:26,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1842084752] [2023-11-29 05:57:26,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1842084752] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:57:26,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:57:26,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:57:26,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15795159] [2023-11-29 05:57:26,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:57:26,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:57:26,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:57:26,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:57:26,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:57:26,891 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-29 05:57:27,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:27,204 INFO L93 Difference]: Finished difference Result 166 states and 221 transitions. [2023-11-29 05:57:27,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:57:27,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 91 [2023-11-29 05:57:27,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:57:27,206 INFO L225 Difference]: With dead ends: 166 [2023-11-29 05:57:27,206 INFO L226 Difference]: Without dead ends: 92 [2023-11-29 05:57:27,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:57:27,208 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 4 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:57:27,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 585 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:57:27,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-29 05:57:27,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2023-11-29 05:57:27,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 56 states have (on average 1.25) internal successors, (70), 58 states have internal predecessors, (70), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2023-11-29 05:57:27,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 119 transitions. [2023-11-29 05:57:27,223 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 119 transitions. Word has length 91 [2023-11-29 05:57:27,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:57:27,223 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 119 transitions. [2023-11-29 05:57:27,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-29 05:57:27,224 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 119 transitions. [2023-11-29 05:57:27,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-29 05:57:27,225 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:27,225 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:57:27,231 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 05:57:27,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:57:27,426 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:27,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:27,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1703413682, now seen corresponding path program 1 times [2023-11-29 05:57:27,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:57:27,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040089906] [2023-11-29 05:57:27,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:27,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:57:27,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:57:27,428 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:57:27,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 05:57:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:27,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 05:57:27,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:32,160 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|) (_ bv0 64))))) is different from true [2023-11-29 05:57:32,386 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 49 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-29 05:57:32,386 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:57:32,832 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-29 05:57:32,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:57:32,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040089906] [2023-11-29 05:57:32,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040089906] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:57:32,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:57:32,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2023-11-29 05:57:32,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206533452] [2023-11-29 05:57:32,833 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:57:32,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 05:57:32,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:57:32,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 05:57:32,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=171, Unknown=1, NotChecked=26, Total=240 [2023-11-29 05:57:32,835 INFO L87 Difference]: Start difference. First operand 90 states and 119 transitions. Second operand has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2023-11-29 05:57:34,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:34,417 INFO L93 Difference]: Finished difference Result 238 states and 331 transitions. [2023-11-29 05:57:34,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 05:57:34,418 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 93 [2023-11-29 05:57:34,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:57:34,420 INFO L225 Difference]: With dead ends: 238 [2023-11-29 05:57:34,420 INFO L226 Difference]: Without dead ends: 163 [2023-11-29 05:57:34,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=136, Invalid=419, Unknown=1, NotChecked=44, Total=600 [2023-11-29 05:57:34,421 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 217 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 312 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:57:34,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 835 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 434 Invalid, 0 Unknown, 312 Unchecked, 1.1s Time] [2023-11-29 05:57:34,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-11-29 05:57:34,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 107. [2023-11-29 05:57:34,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 73 states have internal predecessors, (91), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2023-11-29 05:57:34,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 143 transitions. [2023-11-29 05:57:34,434 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 143 transitions. Word has length 93 [2023-11-29 05:57:34,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:57:34,434 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 143 transitions. [2023-11-29 05:57:34,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2023-11-29 05:57:34,435 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 143 transitions. [2023-11-29 05:57:34,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-29 05:57:34,436 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:34,436 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:57:34,442 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 05:57:34,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:57:34,637 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:34,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:34,637 INFO L85 PathProgramCache]: Analyzing trace with hash -2030853836, now seen corresponding path program 1 times [2023-11-29 05:57:34,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:57:34,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318721697] [2023-11-29 05:57:34,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:34,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:57:34,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:57:34,639 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:57:34,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 05:57:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:34,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:57:34,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:34,899 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-29 05:57:34,899 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:57:34,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:57:34,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318721697] [2023-11-29 05:57:34,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318721697] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:57:34,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:57:34,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:57:34,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438757892] [2023-11-29 05:57:34,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:57:34,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:57:34,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:57:34,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:57:34,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:57:34,902 INFO L87 Difference]: Start difference. First operand 107 states and 143 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 05:57:35,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:35,106 INFO L93 Difference]: Finished difference Result 202 states and 276 transitions. [2023-11-29 05:57:35,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:57:35,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 93 [2023-11-29 05:57:35,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:57:35,108 INFO L225 Difference]: With dead ends: 202 [2023-11-29 05:57:35,108 INFO L226 Difference]: Without dead ends: 110 [2023-11-29 05:57:35,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:57:35,109 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 8 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:57:35,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 313 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:57:35,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-29 05:57:35,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2023-11-29 05:57:35,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 71 states have (on average 1.267605633802817) internal successors, (90), 73 states have internal predecessors, (90), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2023-11-29 05:57:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 142 transitions. [2023-11-29 05:57:35,125 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 142 transitions. Word has length 93 [2023-11-29 05:57:35,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:57:35,125 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 142 transitions. [2023-11-29 05:57:35,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 05:57:35,126 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 142 transitions. [2023-11-29 05:57:35,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-29 05:57:35,127 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:35,127 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:57:35,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-29 05:57:35,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:57:35,328 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:35,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:35,328 INFO L85 PathProgramCache]: Analyzing trace with hash -769936586, now seen corresponding path program 1 times [2023-11-29 05:57:35,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:57:35,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125385124] [2023-11-29 05:57:35,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:35,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:57:35,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:57:35,330 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:57:35,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 05:57:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:35,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:57:35,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:35,530 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-29 05:57:35,530 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:57:35,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:57:35,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125385124] [2023-11-29 05:57:35,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2125385124] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:57:35,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:57:35,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:57:35,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009426353] [2023-11-29 05:57:35,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:57:35,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:57:35,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:57:35,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:57:35,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:57:35,532 INFO L87 Difference]: Start difference. First operand 107 states and 142 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 05:57:35,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:57:35,734 INFO L93 Difference]: Finished difference Result 200 states and 273 transitions. [2023-11-29 05:57:35,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:57:35,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 93 [2023-11-29 05:57:35,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:57:35,736 INFO L225 Difference]: With dead ends: 200 [2023-11-29 05:57:35,736 INFO L226 Difference]: Without dead ends: 108 [2023-11-29 05:57:35,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:57:35,737 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 6 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:57:35,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 403 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:57:35,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-29 05:57:35,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2023-11-29 05:57:35,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 68 states have (on average 1.25) internal successors, (85), 70 states have internal predecessors, (85), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2023-11-29 05:57:35,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 137 transitions. [2023-11-29 05:57:35,751 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 137 transitions. Word has length 93 [2023-11-29 05:57:35,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:57:35,752 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 137 transitions. [2023-11-29 05:57:35,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 05:57:35,752 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 137 transitions. [2023-11-29 05:57:35,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-29 05:57:35,753 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:57:35,753 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:57:35,759 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 05:57:35,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:57:35,954 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:57:35,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:57:35,955 INFO L85 PathProgramCache]: Analyzing trace with hash -725023814, now seen corresponding path program 1 times [2023-11-29 05:57:35,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:57:35,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055792563] [2023-11-29 05:57:35,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:57:35,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:57:35,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:57:35,956 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:57:35,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 05:57:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:57:36,150 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-29 05:57:36,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:57:40,624 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_4 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#2.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_4) (_ bv0 64)) (_ bv16 64)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_4 (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_4) (_ bv0 64)) v_aws_linked_list_back_~list.base_BEFORE_CALL_4)))) is different from true [2023-11-29 05:57:41,807 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 57 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 05:57:41,807 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:57:49,091 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 05:57:49,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2023-11-29 05:57:49,115 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-11-29 05:57:49,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 16 [2023-11-29 05:57:49,130 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-11-29 05:57:49,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:57:49,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055792563] [2023-11-29 05:57:49,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055792563] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:57:49,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:57:49,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 29 [2023-11-29 05:57:49,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815485385] [2023-11-29 05:57:49,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:57:49,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-29 05:57:49,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:57:49,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-29 05:57:49,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=672, Unknown=2, NotChecked=52, Total=812 [2023-11-29 05:57:49,134 INFO L87 Difference]: Start difference. First operand 104 states and 137 transitions. Second operand has 29 states, 23 states have (on average 4.565217391304348) internal successors, (105), 25 states have internal predecessors, (105), 12 states have call successors, (26), 5 states have call predecessors, (26), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) [2023-11-29 05:57:59,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:58:04,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:58:08,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:58:12,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:58:17,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:58:18,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:58:18,058 INFO L93 Difference]: Finished difference Result 270 states and 355 transitions. [2023-11-29 05:58:18,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-29 05:58:18,060 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 23 states have (on average 4.565217391304348) internal successors, (105), 25 states have internal predecessors, (105), 12 states have call successors, (26), 5 states have call predecessors, (26), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) Word has length 94 [2023-11-29 05:58:18,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:58:18,061 INFO L225 Difference]: With dead ends: 270 [2023-11-29 05:58:18,061 INFO L226 Difference]: Without dead ends: 154 [2023-11-29 05:58:18,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=238, Invalid=1656, Unknown=2, NotChecked=84, Total=1980 [2023-11-29 05:58:18,063 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 175 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 68 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 435 IncrementalHoareTripleChecker+Unchecked, 25.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:58:18,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 944 Invalid, 1727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1219 Invalid, 5 Unknown, 435 Unchecked, 25.6s Time] [2023-11-29 05:58:18,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-29 05:58:18,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 132. [2023-11-29 05:58:18,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 94 states have internal predecessors, (115), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2023-11-29 05:58:18,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 170 transitions. [2023-11-29 05:58:18,088 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 170 transitions. Word has length 94 [2023-11-29 05:58:18,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:58:18,089 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 170 transitions. [2023-11-29 05:58:18,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 23 states have (on average 4.565217391304348) internal successors, (105), 25 states have internal predecessors, (105), 12 states have call successors, (26), 5 states have call predecessors, (26), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) [2023-11-29 05:58:18,089 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 170 transitions. [2023-11-29 05:58:18,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 05:58:18,090 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:58:18,090 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:58:18,096 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 05:58:18,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:58:18,291 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:58:18,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:58:18,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1841721954, now seen corresponding path program 2 times [2023-11-29 05:58:18,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:58:18,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064658768] [2023-11-29 05:58:18,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:58:18,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:58:18,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:58:18,293 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:58:18,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 05:58:18,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:58:18,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:58:18,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 05:58:18,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:58:20,876 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 49 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 05:58:20,876 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:58:23,520 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 05:58:23,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2023-11-29 05:58:23,533 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-11-29 05:58:23,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 05:58:23,580 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-11-29 05:58:23,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:58:23,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064658768] [2023-11-29 05:58:23,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064658768] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:58:23,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:58:23,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 19 [2023-11-29 05:58:23,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817636923] [2023-11-29 05:58:23,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:58:23,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 05:58:23,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:58:23,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 05:58:23,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2023-11-29 05:58:23,583 INFO L87 Difference]: Start difference. First operand 132 states and 170 transitions. Second operand has 19 states, 18 states have (on average 4.5) internal successors, (81), 18 states have internal predecessors, (81), 8 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2023-11-29 05:58:28,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:58:32,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:58:37,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:58:41,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:58:45,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:58:48,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:58:48,751 INFO L93 Difference]: Finished difference Result 239 states and 308 transitions. [2023-11-29 05:58:48,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 05:58:48,752 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.5) internal successors, (81), 18 states have internal predecessors, (81), 8 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) Word has length 103 [2023-11-29 05:58:48,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:58:48,754 INFO L225 Difference]: With dead ends: 239 [2023-11-29 05:58:48,754 INFO L226 Difference]: Without dead ends: 166 [2023-11-29 05:58:48,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 178 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=166, Invalid=764, Unknown=0, NotChecked=0, Total=930 [2023-11-29 05:58:48,755 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 141 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 65 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:58:48,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 970 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 759 Invalid, 5 Unknown, 0 Unchecked, 24.3s Time] [2023-11-29 05:58:48,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-11-29 05:58:48,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2023-11-29 05:58:48,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 118 states have (on average 1.2372881355932204) internal successors, (146), 119 states have internal predecessors, (146), 28 states have call successors, (28), 15 states have call predecessors, (28), 15 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2023-11-29 05:58:48,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 204 transitions. [2023-11-29 05:58:48,784 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 204 transitions. Word has length 103 [2023-11-29 05:58:48,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:58:48,784 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 204 transitions. [2023-11-29 05:58:48,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.5) internal successors, (81), 18 states have internal predecessors, (81), 8 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2023-11-29 05:58:48,785 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 204 transitions. [2023-11-29 05:58:48,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 05:58:48,786 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:58:48,786 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:58:48,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-29 05:58:48,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:58:48,987 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:58:48,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:58:48,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1643898716, now seen corresponding path program 1 times [2023-11-29 05:58:48,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:58:48,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115552885] [2023-11-29 05:58:48,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:48,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:58:48,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:58:48,988 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:58:48,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 05:58:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:49,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-29 05:58:49,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:58:49,814 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 51 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-29 05:58:49,814 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:58:50,381 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 05:58:50,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2023-11-29 05:58:50,542 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-11-29 05:58:50,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:58:50,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115552885] [2023-11-29 05:58:50,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115552885] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:58:50,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:58:50,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2023-11-29 05:58:50,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521410776] [2023-11-29 05:58:50,543 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:58:50,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 05:58:50,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:58:50,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 05:58:50,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=232, Unknown=1, NotChecked=0, Total=272 [2023-11-29 05:58:50,544 INFO L87 Difference]: Start difference. First operand 162 states and 204 transitions. Second operand has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 15 states have internal predecessors, (87), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-29 05:58:56,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:58:57,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:58:57,189 INFO L93 Difference]: Finished difference Result 319 states and 420 transitions. [2023-11-29 05:58:57,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 05:58:57,191 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 15 states have internal predecessors, (87), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 103 [2023-11-29 05:58:57,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:58:57,192 INFO L225 Difference]: With dead ends: 319 [2023-11-29 05:58:57,193 INFO L226 Difference]: Without dead ends: 212 [2023-11-29 05:58:57,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=174, Invalid=879, Unknown=3, NotChecked=0, Total=1056 [2023-11-29 05:58:57,194 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 127 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 25 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:58:57,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 893 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 449 Invalid, 2 Unknown, 0 Unchecked, 5.4s Time] [2023-11-29 05:58:57,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-11-29 05:58:57,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 170. [2023-11-29 05:58:57,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 124 states have (on average 1.2338709677419355) internal successors, (153), 125 states have internal predecessors, (153), 28 states have call successors, (28), 15 states have call predecessors, (28), 17 states have return successors, (36), 29 states have call predecessors, (36), 27 states have call successors, (36) [2023-11-29 05:58:57,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 217 transitions. [2023-11-29 05:58:57,228 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 217 transitions. Word has length 103 [2023-11-29 05:58:57,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:58:57,229 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 217 transitions. [2023-11-29 05:58:57,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 15 states have internal predecessors, (87), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-29 05:58:57,229 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 217 transitions. [2023-11-29 05:58:57,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 05:58:57,231 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:58:57,231 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:58:57,238 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 05:58:57,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:58:57,431 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:58:57,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:58:57,432 INFO L85 PathProgramCache]: Analyzing trace with hash -722795878, now seen corresponding path program 1 times [2023-11-29 05:58:57,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:58:57,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294320718] [2023-11-29 05:58:57,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:57,432 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:58:57,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:58:57,433 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:58:57,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 05:58:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:57,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:58:57,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:58:57,657 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-29 05:58:57,657 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:58:57,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:58:57,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294320718] [2023-11-29 05:58:57,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [294320718] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:58:57,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:58:57,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:58:57,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503891432] [2023-11-29 05:58:57,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:58:57,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:58:57,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:58:57,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:58:57,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:58:57,659 INFO L87 Difference]: Start difference. First operand 170 states and 217 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 05:58:57,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:58:57,825 INFO L93 Difference]: Finished difference Result 297 states and 384 transitions. [2023-11-29 05:58:57,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:58:57,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 103 [2023-11-29 05:58:57,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:58:57,827 INFO L225 Difference]: With dead ends: 297 [2023-11-29 05:58:57,827 INFO L226 Difference]: Without dead ends: 166 [2023-11-29 05:58:57,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:58:57,829 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:58:57,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 420 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:58:57,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-11-29 05:58:57,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2023-11-29 05:58:57,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 120 states have (on average 1.2) internal successors, (144), 121 states have internal predecessors, (144), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (34), 28 states have call predecessors, (34), 27 states have call successors, (34) [2023-11-29 05:58:57,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 206 transitions. [2023-11-29 05:58:57,856 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 206 transitions. Word has length 103 [2023-11-29 05:58:57,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:58:57,856 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 206 transitions. [2023-11-29 05:58:57,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 05:58:57,856 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 206 transitions. [2023-11-29 05:58:57,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-29 05:58:57,857 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:58:57,857 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:58:57,863 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 05:58:58,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:58:58,058 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:58:58,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:58:58,058 INFO L85 PathProgramCache]: Analyzing trace with hash 235574540, now seen corresponding path program 1 times [2023-11-29 05:58:58,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:58:58,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517118555] [2023-11-29 05:58:58,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:58:58,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:58:58,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:58:58,060 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:58:58,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 05:58:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:58:58,269 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 05:58:58,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:58:58,412 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 05:58:58,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2023-11-29 05:59:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-11-29 05:59:00,965 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:59:00,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:59:00,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [517118555] [2023-11-29 05:59:00,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [517118555] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:59:00,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:59:00,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 05:59:00,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976593315] [2023-11-29 05:59:00,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:59:00,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 05:59:00,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:59:00,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 05:59:00,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:59:00,967 INFO L87 Difference]: Start difference. First operand 165 states and 206 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 5 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 05:59:05,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:59:05,303 INFO L93 Difference]: Finished difference Result 407 states and 514 transitions. [2023-11-29 05:59:05,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:59:05,303 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 5 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 104 [2023-11-29 05:59:05,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:59:05,305 INFO L225 Difference]: With dead ends: 407 [2023-11-29 05:59:05,305 INFO L226 Difference]: Without dead ends: 323 [2023-11-29 05:59:05,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 81 SyntacticMatches, 12 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:59:05,306 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 76 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:59:05,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 559 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-11-29 05:59:05,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2023-11-29 05:59:05,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 321. [2023-11-29 05:59:05,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 235 states have (on average 1.195744680851064) internal successors, (281), 237 states have internal predecessors, (281), 54 states have call successors, (54), 29 states have call predecessors, (54), 31 states have return successors, (66), 54 states have call predecessors, (66), 52 states have call successors, (66) [2023-11-29 05:59:05,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 401 transitions. [2023-11-29 05:59:05,376 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 401 transitions. Word has length 104 [2023-11-29 05:59:05,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:59:05,376 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 401 transitions. [2023-11-29 05:59:05,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 5 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-29 05:59:05,377 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 401 transitions. [2023-11-29 05:59:05,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-29 05:59:05,378 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:59:05,378 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:59:05,386 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 05:59:05,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:59:05,579 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:59:05,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:59:05,580 INFO L85 PathProgramCache]: Analyzing trace with hash -157452470, now seen corresponding path program 1 times [2023-11-29 05:59:05,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:59:05,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026310997] [2023-11-29 05:59:05,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:59:05,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:59:05,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:59:05,581 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:59:05,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 05:59:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:59:05,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-29 05:59:05,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:59:08,499 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 46 proven. 5 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-29 05:59:08,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:59:11,123 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 05:59:11,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2023-11-29 05:59:11,144 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-11-29 05:59:11,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 05:59:11,168 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-11-29 05:59:11,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:59:11,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026310997] [2023-11-29 05:59:11,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026310997] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:59:11,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:59:11,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 23 [2023-11-29 05:59:11,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587846461] [2023-11-29 05:59:11,169 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:59:11,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 05:59:11,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:59:11,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 05:59:11,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2023-11-29 05:59:11,170 INFO L87 Difference]: Start difference. First operand 321 states and 401 transitions. Second operand has 23 states, 22 states have (on average 3.727272727272727) internal successors, (82), 22 states have internal predecessors, (82), 8 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2023-11-29 05:59:16,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:59:20,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:59:24,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:59:28,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:59:32,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:59:32,320 INFO L93 Difference]: Finished difference Result 497 states and 631 transitions. [2023-11-29 05:59:32,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 05:59:32,321 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.727272727272727) internal successors, (82), 22 states have internal predecessors, (82), 8 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) Word has length 104 [2023-11-29 05:59:32,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:59:32,324 INFO L225 Difference]: With dead ends: 497 [2023-11-29 05:59:32,324 INFO L226 Difference]: Without dead ends: 337 [2023-11-29 05:59:32,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 176 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=296, Invalid=1344, Unknown=0, NotChecked=0, Total=1640 [2023-11-29 05:59:32,326 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 215 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 49 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:59:32,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 918 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 722 Invalid, 4 Unknown, 0 Unchecked, 19.6s Time] [2023-11-29 05:59:32,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2023-11-29 05:59:32,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 321. [2023-11-29 05:59:32,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 235 states have (on average 1.1872340425531915) internal successors, (279), 237 states have internal predecessors, (279), 54 states have call successors, (54), 29 states have call predecessors, (54), 31 states have return successors, (66), 54 states have call predecessors, (66), 52 states have call successors, (66) [2023-11-29 05:59:32,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 399 transitions. [2023-11-29 05:59:32,375 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 399 transitions. Word has length 104 [2023-11-29 05:59:32,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:59:32,375 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 399 transitions. [2023-11-29 05:59:32,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.727272727272727) internal successors, (82), 22 states have internal predecessors, (82), 8 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2023-11-29 05:59:32,376 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 399 transitions. [2023-11-29 05:59:32,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-29 05:59:32,381 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:59:32,381 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:59:32,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-11-29 05:59:32,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:59:32,582 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:59:32,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:59:32,582 INFO L85 PathProgramCache]: Analyzing trace with hash 100712968, now seen corresponding path program 1 times [2023-11-29 05:59:32,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:59:32,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734835017] [2023-11-29 05:59:32,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:59:32,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:59:32,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:59:32,584 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:59:32,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 05:59:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:59:32,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-29 05:59:32,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:59:37,017 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_14| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_14| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_14|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_14|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_14| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_14| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_14|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_14|))))) is different from true [2023-11-29 05:59:41,150 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_15| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_15| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_15|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_15|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_15| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_15| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_15|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_15|))))) is different from true [2023-11-29 05:59:45,341 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_30 (_ BitVec 64)) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_31 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_30) v_aws_linked_list_back_~list.offset_BEFORE_CALL_31)))) (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_30 (_ BitVec 64)) (v_aws_linked_list_back_~list.offset_BEFORE_CALL_31 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_30) v_aws_linked_list_back_~list.offset_BEFORE_CALL_31))))) is different from true [2023-11-29 05:59:49,453 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_32 (_ BitVec 64)) (v_aws_linked_list_back_~list.base_BEFORE_CALL_31 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_31) v_aws_linked_list_back_~list.offset_BEFORE_CALL_32)))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_32 (_ BitVec 64)) (v_aws_linked_list_back_~list.base_BEFORE_CALL_31 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_31) v_aws_linked_list_back_~list.offset_BEFORE_CALL_32))))) is different from true [2023-11-29 05:59:53,599 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_33 (_ BitVec 64)) (v_aws_linked_list_back_~list.base_BEFORE_CALL_32 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_32) v_aws_linked_list_back_~list.offset_BEFORE_CALL_33)))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_33 (_ BitVec 64)) (v_aws_linked_list_back_~list.base_BEFORE_CALL_32 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_32) v_aws_linked_list_back_~list.offset_BEFORE_CALL_33))))) is different from true [2023-11-29 05:59:57,736 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_34 (_ BitVec 64)) (v_aws_linked_list_back_~list.base_BEFORE_CALL_33 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_33) v_aws_linked_list_back_~list.offset_BEFORE_CALL_34)))) (exists ((v_aws_linked_list_back_~list.offset_BEFORE_CALL_34 (_ BitVec 64)) (v_aws_linked_list_back_~list.base_BEFORE_CALL_33 (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| v_aws_linked_list_back_~list.base_BEFORE_CALL_33) v_aws_linked_list_back_~list.offset_BEFORE_CALL_34))))) is different from true [2023-11-29 06:00:10,472 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 18 not checked. [2023-11-29 06:00:10,472 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:00:15,384 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 06:00:15,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2023-11-29 06:00:15,408 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-11-29 06:00:15,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 06:00:15,463 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-11-29 06:00:15,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:00:15,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734835017] [2023-11-29 06:00:15,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1734835017] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:00:15,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:00:15,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 23 [2023-11-29 06:00:15,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951777293] [2023-11-29 06:00:15,464 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:00:15,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 06:00:15,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:00:15,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 06:00:15,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=221, Unknown=10, NotChecked=210, Total=506 [2023-11-29 06:00:15,466 INFO L87 Difference]: Start difference. First operand 321 states and 399 transitions. Second operand has 23 states, 23 states have (on average 3.652173913043478) internal successors, (84), 22 states have internal predecessors, (84), 5 states have call successors, (20), 8 states have call predecessors, (20), 9 states have return successors, (18), 5 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-29 06:00:19,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:00:23,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:00:27,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:00:40,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:00:44,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:00:56,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:01:04,872 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_14| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_14| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_14|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_14|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_14| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_14| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_14|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_14|))))) (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_15| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_15| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_15|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_15|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_15| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_15| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_15|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_15|)))))) is different from true [2023-11-29 06:01:09,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:01:13,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:01:17,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:01:21,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:01:41,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:01:45,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:01:49,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:01:53,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:01:57,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:02:01,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:02:05,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:02:09,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:02:13,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:02:17,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:02:21,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:02:25,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:02:29,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:02:30,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:02:34,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:02:39,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:02:43,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:02:47,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:02:51,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:02:55,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:03:07,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:03:11,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:03:15,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:03:19,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:03:19,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:03:19,439 INFO L93 Difference]: Finished difference Result 640 states and 802 transitions. [2023-11-29 06:03:19,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 06:03:19,440 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.652173913043478) internal successors, (84), 22 states have internal predecessors, (84), 5 states have call successors, (20), 8 states have call predecessors, (20), 9 states have return successors, (18), 5 states have call predecessors, (18), 4 states have call successors, (18) Word has length 104 [2023-11-29 06:03:19,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:03:19,443 INFO L225 Difference]: With dead ends: 640 [2023-11-29 06:03:19,443 INFO L226 Difference]: Without dead ends: 476 [2023-11-29 06:03:19,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 180 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 90.2s TimeCoverageRelationStatistics Valid=168, Invalid=488, Unknown=22, NotChecked=378, Total=1056 [2023-11-29 06:03:19,445 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 145 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 10 mSolverCounterUnsat, 33 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 134.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 1817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 33 IncrementalHoareTripleChecker+Unknown, 1420 IncrementalHoareTripleChecker+Unchecked, 134.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:03:19,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 602 Invalid, 1817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 354 Invalid, 33 Unknown, 1420 Unchecked, 134.9s Time] [2023-11-29 06:03:19,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2023-11-29 06:03:19,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 361. [2023-11-29 06:03:19,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 267 states have (on average 1.1797752808988764) internal successors, (315), 271 states have internal predecessors, (315), 54 states have call successors, (54), 35 states have call predecessors, (54), 39 states have return successors, (70), 54 states have call predecessors, (70), 52 states have call successors, (70) [2023-11-29 06:03:19,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 439 transitions. [2023-11-29 06:03:19,515 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 439 transitions. Word has length 104 [2023-11-29 06:03:19,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:03:19,516 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 439 transitions. [2023-11-29 06:03:19,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.652173913043478) internal successors, (84), 22 states have internal predecessors, (84), 5 states have call successors, (20), 8 states have call predecessors, (20), 9 states have return successors, (18), 5 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-29 06:03:19,516 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 439 transitions. [2023-11-29 06:03:19,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-29 06:03:19,518 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:03:19,518 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:03:19,524 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-29 06:03:19,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:03:19,719 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:03:19,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:03:19,719 INFO L85 PathProgramCache]: Analyzing trace with hash -910404282, now seen corresponding path program 1 times [2023-11-29 06:03:19,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:03:19,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839508910] [2023-11-29 06:03:19,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:03:19,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:03:19,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:03:19,721 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:03:19,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2caee67-a04a-43c7-8eae-0ab5458bba3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 06:03:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:03:19,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 06:03:19,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:03:20,104 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-11-29 06:03:20,105 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:03:20,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:03:20,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839508910] [2023-11-29 06:03:20,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839508910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:03:20,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:03:20,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:03:20,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743436646] [2023-11-29 06:03:20,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:03:20,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 06:03:20,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:03:20,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:03:20,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:03:20,107 INFO L87 Difference]: Start difference. First operand 361 states and 439 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-29 06:03:20,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:03:20,571 INFO L93 Difference]: Finished difference Result 718 states and 897 transitions. [2023-11-29 06:03:20,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:03:20,572 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 104 [2023-11-29 06:03:20,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:03:20,574 INFO L225 Difference]: With dead ends: 718 [2023-11-29 06:03:20,574 INFO L226 Difference]: Without dead ends: 348 [2023-11-29 06:03:20,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:03:20,576 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 26 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:03:20,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 592 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:03:20,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states.